László Lovász

J. Comb. Theory B, 2024

Random homomorphisms into the orthogonality graph.

[BibT_eX]

[DOI]

Dávid Kunszenti-Kovács

J. Comb. Theory B, 2024

2023

Locally common graphs.

[BibT_eX]

[DOI]

Endre Csóka

Tamás Hubai

J. Graph Theory, 2023

2021

Discrete Quantitative Nodal Theorem.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2019

Measures on the square as sparse graph limits.

[BibT_eX]

[DOI]

Dávid Kunszenti-Kovács

J. Comb. Theory B, 2019

2016

Positive graphs.

[BibT_eX]

[DOI]

Tamás Hubai

Dávid Kunszenti-Kovács

Electron. Notes Discret. Math., 2016

Preface.

[BibT_eX]

[DOI]

Jaroslav Nesetril

Eur. J. Comb., 2016

Positive graphs.

[BibT_eX]

[DOI]

Omar Antolín Camarena

Eur. J. Comb., 2016

2013

Left and right convergence of graphs with bounded degree.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2013

Preface.

[BibT_eX]

[DOI]

Attila Sali

Vera T. Sós

Electron. Notes Discret. Math., 2013

Non-Deterministic Graph Property Testing.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2013

2012

Local Versus Global Properties of Metric Spaces.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Random graphons and a weak Positivstellensatz for graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

Computational results of an O∗(n4) volume algorithm.

[BibT_eX]

[DOI]

István Deák

Eur. J. Oper. Res., 2012

Nondeterministic graph property testing

[BibT_eX]

[DOI]

CoRR, 2012

Large Networks and Graph Limits.

[BibT_eX]

[DOI]

Colloquium Publications 60, American Mathematical Society, ISBN: 978-0-8218-9085-1, 2012

2011

Finitely forcible graphons.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2011

Preface.

[BibT_eX]

[DOI]

Jaroslav Nesetril

Patrice Ossona de Mendez

Eur. J. Comb., 2011

Limits of randomly grown graph sequences.

[BibT_eX]

[DOI]

Eur. J. Comb., 2011

Subgraph Densities in Signed Graphons and the Local Simonovits-Sidorenko Conjecture.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

Dot Product Representations of Planar Graphs.

[BibT_eX]

[DOI]

Ross J. Kang

Tobias Müller

Edward R. Scheinerman

Electron. J. Comb., 2011

2010

The History of the LLL-Algorithm.

[BibT_eX]

[DOI]

Proceedings of the LLL Algorithm - Survey and Applications, 2010

Dual graph homomorphism functions.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2010

Exit Frequency Matrices for Finite Markov Chains.

[BibT_eX]

[DOI]

Andrew Beveridge

Comb. Probab. Comput., 2010

2009

Contractors and connectors of graph algebras.

[BibT_eX]

[DOI]

J. Graph Theory, 2009

Approximate Counting and Quantum Computation

[BibT_eX]

[DOI]

CoRR, 2009

Semidefinite Functions on Categories.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

2008

Generalized quasirandom graphs.

[BibT_eX]

[DOI]

Vera T. Sós

J. Comb. Theory B, 2008

Graph parameters and semigroup functions.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

Some Mathematics behind Graph Property Testing.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

2007

The geometry of logconcave functions and sampling algorithms.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2007

(Almost) Tight bounds and existence theorems for single-commodity confluent flows.

[BibT_eX]

[DOI]

J. ACM, 2007

Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding.

[BibT_eX]

[DOI]

Kamal Jain

Philip A. Chou

Distributed Comput., 2007

Approximating Graphs by Graphs and Functions (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

2006

Proving Integrality Gaps without Knowing the Linear Program.

[BibT_eX]

[DOI]

Theory Comput., 2006

Hit-and-Run from a Corner.

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

Limits of dense graph sequences.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

A localization inequality for set functions.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

Simulated annealing in convex bodies and an O*(n4) volume algorithm.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2006

Semi-matchings for bipartite graphs and load balancing.

[BibT_eX]

[DOI]

Nicholas J. A. Harvey

Richard E. Ladner

Tami Tamir

J. Algorithms, 2006

The rank of connection matrices and the dimension of graph algebras.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

Blocking Conductance and Mixing in Random Walks.

[BibT_eX]

[DOI]

Ravi Montenegro

Comb. Probab. Comput., 2006

Waiting for a Bat to Fly By (in Polynomial Time).

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2006

Graph limits and parameter testing.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005

Review of the book by Alexander Schrijver: Combinatorial Optimization: Polyhedra and Efficiency.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2005

2004

Approximating Min Sum Set Cover.

[BibT_eX]

[DOI]

Uriel Feige

Prasad Tetali

Algorithmica, 2004

(Almost) tight bounds and existence theorems for confluent flows.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

2003

Logconcave Functions: Geometry and Efficient Sampling Algorithms

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002

Lecture Notes on Evasiveness of Graph Properties

[BibT_eX]

[DOI]

Neal E. Young

CoRR, 2002

Global Information from Local Observation.

[BibT_eX]

[DOI]

Itai Benjamini

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Proving Integrality Gaps without Knowing the Linear Program.

[BibT_eX]

[DOI]

Sanjeev Arora

Béla Bollobás

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001

Steinitz Representations of Polyhedra and the Colin de Verdière Number.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Energy of Convex Sets, Shortest Paths, and Resistance.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2001

Unextendible Product Bases.

[BibT_eX]

[DOI]

Noga Alon

J. Comb. Theory A, 2001

Critical Facets of the Stable Set Polytope.

[BibT_eX]

[DOI]

László Lipták

Comb., 2001

2000

Facets with fixed defect of the stable set polytope.

[BibT_eX]

[DOI]

László Lipták

Math. Program., 2000

The Cover Time, the Blanket Time, and the Matthews Bound.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

Hit-and-run mixes fast.

[BibT_eX]

[DOI]

Math. Program., 1999

Faster Mixing via Average Conductance.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Lifting Markov Chains to Speed up Mixing.

[BibT_eX]

[DOI]

Fang Chen

Igor Pak

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

1998

Random walks and the regeneration time.

[BibT_eX]

[DOI]

Andrew Beveridge

J. Graph Theory, 1998

Reversal of Markov Chains and the Forget Time.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1998

Approximation of Diameters: Randomization Doesn't Help.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

Random walks and an O*(n5) volume algorithm for convex bodies.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1997

The Membership Problem in Jump Systems.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

On Conway's Thrackle Conjecture.

[BibT_eX]

[DOI]

János Pach

Mario Szegedy

Discret. Comput. Geom., 1997

The Colin de Verdière Number and Sphere Representations of a Graph.

[BibT_eX]

[DOI]

Andrew Kotlov

Comb., 1997

Mixing times.

[BibT_eX]

[DOI]

Proceedings of the Microsurveys in Discrete Probability, 1997

1996

The rank and size of graphs.

[BibT_eX]

[DOI]

Andrew Kotlov

J. Graph Theory, 1996

Interactive Proofs and the Hardness of Approximating Cliques.

[BibT_eX]

[DOI]

J. ACM, 1996

1995

Search Problems in the Decision Tree Model.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1995

Isoperimetric Problems for Convex Bodies and a Localization Lemama.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1995

Exact Mixing in an Unknown Markov Chain.

[BibT_eX]

[DOI]

Electron. J. Comb., 1995

Efficient stopping rules for Markov chains.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994

Stable sets and polynomials.

[BibT_eX]

[DOI]

Discret. Math., 1994

1993

A Monte-Carlo Algorithm for Estimating the Permanent.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

Random Walks in a Convex Body and an Improved Volume Algorithm.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1993

A note on the last new vertex visited by a random walk.

[BibT_eX]

[DOI]

J. Graph Theory, 1993

Communication Complexity and Combinatorial Lattice Theory.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1993

The Cocycle Lattice of Binary Matroids .

[BibT_eX]

[DOI]

Ákos Seress

Eur. J. Comb., 1993

Dating to Marriage.

[BibT_eX]

[DOI]

J. Csima

Discret. Appl. Math., 1993

Randomized algorithms in combinatorial optimization.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization, 1993

Combinatorial problems and exercises (2. ed.).

[BibT_eX]

North-Holland, ISBN: 978-0-444-81504-0, 1993

1992

The Generalized Basis Reduction Algorithm.

[BibT_eX]

[DOI]

Herbert E. Scarf

Math. Oper. Res., 1992

A matching algorithm for regular bipartite graphs.

[BibT_eX]

[DOI]

J. Csima

Discret. Appl. Math., 1992

On integer points in polyhedra: a lower bound.

[BibT_eX]

[DOI]

Imre Bárány

Roger Howe

Comb., 1992

Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract)

[BibT_eX]

[DOI]

Uriel Feige

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Linear Decision Trees: Volume Estimates and Topological Bounds

[BibT_eX]

[DOI]

Anders Björner

Andrew Chi-Chih Yao

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

On the Randomized Complexity of Volume and Diameter

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Cones of Matrices and Set-Functions and 0-1 Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 1991

Chip-firing Games on Graphs.

[BibT_eX]

[DOI]

Anders Björner

Peter W. Shor

Eur. J. Comb., 1991

Graphs with Given Automorphism Group and Few Edge Orbits.

[BibT_eX]

[DOI]

László Babai

Albert J. Goodman

Eur. J. Comb., 1991

Search Problems in the Decision Tree Model (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Approximating Clique is Almost NP-Complete (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

The Shapes of Polyhedra.

[BibT_eX]

[DOI]

Herbert E. Scarf

Math. Oper. Res., 1990

Entropy splitting for antiblocking corners and perfect graphs.

[BibT_eX]

[DOI]

Comb., 1990

On the number of halving planes.

[BibT_eX]

[DOI]

Imre Bárány

Zoltán Füredi

Comb., 1990

The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Matrix Cones, Projection Representations, and Stable Set Polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Polyhedral Combinatorics, 1990

1989

An on-line graph coloring algorithm with sublinear performance ratio.

[BibT_eX]

[DOI]

William T. Trotter

Discret. Math., 1989

The intersection of matroids and antimatroids.

[BibT_eX]

[DOI]

Discret. Math., 1989

On the Graph of Large Distance.

[BibT_eX]

[DOI]

Paul Erdös

Discret. Comput. Geom., 1989

Faster Algorithms for Hard Problems.

[BibT_eX]

Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

1988

Rubber bands, convex embeddings and graph connectivity.

[BibT_eX]

[DOI]

Nathan Linial

Avi Wigderson

Comb., 1988

Lattices, Möbius Functions and Communication Complexity

[BibT_eX]

[DOI]

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Geometric Algorithms and Combinatorial Optimization

[BibT_eX]

[DOI]

Algorithms and Combinatorics 2, Springer, ISBN: 978-3-642-97881-4, 1988

1987

Matching structure and the matching lattice.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1987

On some combinatorial properties of algebraic matroids.

[BibT_eX]

[DOI]

Andreas W. M. Dress

Comb., 1987

1986

Searching in Trees, Series-Parallel and Interval Orders.

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

Relaxations of vertex packing.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1986

Discrepancy of Set-systems and Matrices.

[BibT_eX]

[DOI]

Joel Spencer

Eur. J. Comb., 1986

Non-interval greedoids and the transposition property.

[BibT_eX]

[DOI]

Discret. Math., 1986

Homomorphisms and Ramsey properties of antimatroids.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1986

Connectivity Algorithms Using Rubber-bands.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986

Covering Minima and Lattice Point Free Convex Bodies.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986

A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications

[BibT_eX]

[DOI]

Nathan Linial

Avi Wigderson

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

Algorithmic theory of numbers, graphs and convexity.

[BibT_eX]

CBMS-NSF regional conference series in applied mathematics 50, SIAM, ISBN: 978-0-89871-203-2, 1986

1985

Relations between subclasses of greedoids.

[BibT_eX]

[DOI]

Z. Oper. Research, 1985

Lengths of cycles in halin graphs.

[BibT_eX]

[DOI]

J. Adrian Bondy

J. Graph Theory, 1985

Polymatroid greedoids.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1985

A Note on Selectors and Greedoids.

[BibT_eX]

[DOI]

Eur. J. Comb., 1985

Vertex Packing Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1985

Computing ears and branchings in parallel

[BibT_eX]

[DOI]

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984

Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization".

[BibT_eX]

[DOI]

Comb., 1984

Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers

[BibT_eX]

[DOI]

Ravindran Kannan

Arjen K. Lenstra

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983

Ear-decompositions of matching covered graphs.

[BibT_eX]

[DOI]

Comb., 1983

Structural properties of greedoids.

[BibT_eX]

[DOI]

Comb., 1983

1982

Tibor Gallai.

[BibT_eX]

[DOI]

Comb., 1982

Brick decompositions and the matching rank of graphs.

[BibT_eX]

[DOI]

Jack Edmonds

William R. Pulleyblank

Comb., 1982

Submodular functions and convexity.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Programming The State of the Art, 1982

1981

The ellipsoid method and its consequences in combinatorial optimization.

[BibT_eX]

[DOI]

Comb., 1981

Cycles through specified vertices of a graph.

[BibT_eX]

[DOI]

J. Adrian Bondy

Comb., 1981

Mathematical Structures Underlying Greedy Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1981

1980

On a product dimension of graphs.

[BibT_eX]

[DOI]

Jaroslav Nesetril

Ales Pultr

J. Comb. Theory B, 1980

Matroid matching and some applications.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1980

Matroids and Sperner's Lemma.

[BibT_eX]

[DOI]

Eur. J. Comb., 1980

1979

On the Shannon capacity of a graph.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1979

Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems

[BibT_eX]

[DOI]

Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

On determinants, matchings, and random algorithms.

[BibT_eX]

Proceedings of the Fundamentals of Computation Theory, 1979

1978

Kneser's Conjecture, Chromatic Number, and Homotopy.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1978

1977

Some Remarks on Generalized Spectra.

[BibT_eX]

[DOI]

Péter Gács

Math. Log. Q., 1977

On minimal elementary bipartite graphs.

[BibT_eX]

[DOI]

Michael D. Plummer

J. Comb. Theory B, 1977

1976

On two minimax theorems in graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1976

1975

On the ratio of optimal integral and fractional covers.

[BibT_eX]

[DOI]

Discret. Math., 1975

1972

Normal hypergraphs and the perfect graph conjecture.

[BibT_eX]

[DOI]