Source

Annals of discrete mathematics

ISSNs: 0167-5060, 2543-1099

Source type: book series

Fully OA: No

DOAJ: No

OpenAlex ID: S2765065777

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

1979 · R.L. Graham, E.L. Lawler, et al. · Annals of discrete mathematics · 5,894

Algorithmic Graph Theory and Perfect Graphs

2004 · Annals of discrete mathematics · 3,729

Complexity of Machine Scheduling Problems

1977 · J.K. Lenstra, A.H.G. Rinnooy Kan, et al. · Annals of discrete mathematics · 2,214

PDF

Submodular Functions and Optimization

2005 · Annals of discrete mathematics · 1,152

A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness

1977 · Eugene L. Lawler · Annals of discrete mathematics · 613

A Min-Max Relation for Submodular Functions on Graphs

1977 · Jack Edmonds, Rick Giles · Annals of discrete mathematics · 526

Discrete Convex Analysis

2005 · Annals of discrete mathematics · 509

PDF

Threshold Graphs and Related Topics

1995 · Annals of discrete mathematics · 493

Disjunctive Programming

1979 · Egon Balas · Annals of discrete mathematics · 485

Aggregation of Inequalities in Integer Programming

1977 · Václav Chvátal, Peter L. Hammer · Annals of discrete mathematics · 449

Decompositions of Rational Convex Polytopes

1980 · Richard P. Stanley · Annals of discrete mathematics · 356

Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints

1978 · E.L. Lawler · Annals of discrete mathematics · 354

Recent Results in the Theory of Graph Spectra

1988 · Annals of discrete mathematics · 345

Computational Complexity of Discrete Optimization Problems

1979 · J.K. Lenstra, A.H.G. Rinnooy Kan · Annals of discrete mathematics · 294

A Reduction Method for Edge-Connectivity in Graphs

1978 · W. Mader · Annals of discrete mathematics · 278

Linear and Combinatorial Optimization in Ordered Algebraic Structures

1981 · Annals of discrete mathematics · 252

Annals of Discrete Mathematics 58

2005 · Annals of discrete mathematics · 237

Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations

1978 · Ronald C. Read · Annals of discrete mathematics · 232

Percolation Probabilities on the Square Lattice

1978 · P.D. Seymour, D.J.A. Welsh · Annals of discrete mathematics · 230

Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem

1977 · Ole Bilde, Jakob Krarup · Annals of discrete mathematics · 226

Methods of Nonlinear 0-1 Programming

1979 · Pierre Hansen · Annals of discrete mathematics · 220

Perfect graphs

2004 · Martin Charles Golumbic · Annals of discrete mathematics · 219

Eulerian Graphs and Related Topics

1991 · Annals of discrete mathematics · 216

Annals of Discrete Mathematics 46

1991 · Annals of discrete mathematics · 201

An Analysis of the Greedy Heuristic for Independence Systems

1978 · Bernhard Korte, Dirk Hausmann · Annals of discrete mathematics · 191

Works count: 1,084

Citation count: 29,360

H-index: 58

I10-index: 247

2yr mean citedness: