Martin Loebl

Discret. Math., 2024

2023

Promoting Non-Cooperation Through Ordering.

[BibT_eX]

[DOI]

David Sychrovsky

Sameer Desai

CoRR, 2023

Rule Enforcing Through Ordering.

[BibT_eX]

[DOI]

David Sychrovsky

Sameer Desai

Proceedings of the Decision and Game Theory for Security: 14th International Conference, 2023

Price of Anarchy in a Double-Sided Critical Distribution System.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

Critical Distribution System.

[BibT_eX]

[DOI]

Anetta Jedlickova

David Sychrovsky

CoRR, 2022

2021

Arc-routing for winter road maintenance.

[BibT_eX]

[DOI]

Jirí Fink

Petra Pelikánová

Discret. Optim., 2021

2020

A New Arc-Routing Algorithm Applied to Winter Road Maintenance.

[BibT_eX]

[DOI]

Jirí Fink

Petra Pelikánová

CoRR, 2020

Arc-routing for winter road maintenance.

[BibT_eX]

[DOI]

Jirí Fink

CoRR, 2020

2019

The Precise Complexity of Finding Rainbow Even Matchings.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics - 8th International Conference, 2019

2017

Binary linear codes, dimers and hypermatrices.

[BibT_eX]

[DOI]

Pavel Rytír

Electron. Notes Discret. Math., 2017

2016

Cubic Bridgeless Graphs and Braces.

[BibT_eX]

[DOI]

Andrea Jiménez

Mihyun Kang

Graphs Comb., 2016

2015

Discrete Dirac Operators, Critical Embeddings and Ihara-Selberg Functions.

[BibT_eX]

[DOI]

Petr Somberg

Electron. J. Comb., 2015

2014

Directed cycle double covers and cut-obstacles.

[BibT_eX]

[DOI]

Andrea Jiménez

CoRR, 2014

2013

Tournaments and colouring.

[BibT_eX]

[DOI]

Eli Berger

Krzysztof Choromanski

J. Comb. Theory B, 2013

2012

Bass' identity and a coin arrangements lemma.

[BibT_eX]

[DOI]

Hossein Teimoori Faal

Eur. J. Comb., 2012

2011

A permanent formula for the Jones polynomial.

[BibT_eX]

[DOI]

Iain Moffatt

Adv. Appl. Math., 2011

2010

DNA-inspired information concealing: A survey.

[BibT_eX]

[DOI]

Lukas Kencl

Comput. Sci. Rev., 2010

Satisfying States of Triangulations of a Convex n-gon.

[BibT_eX]

[DOI]

Andrea Jiménez

Electron. J. Comb., 2010

2009

DNA-Inspired Information Concealing

[BibT_eX]

[DOI]

Lukas Kencl

CoRR, 2009

Discrete Mathematics in Statistical Physics - Introductory Lectures.

[BibT_eX]

[DOI]

Advanced lectures in mathematics, Vieweg, ISBN: 978-3-528-03219-7, 2009

2008

The 3D Dimer and Ising problems revisited.

[BibT_eX]

[DOI]

Lenka Zdeborová

Eur. J. Comb., 2008

Towards the Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

2006

Jamming and Geometric Representations of Graphs.

[BibT_eX]

[DOI]

Werner Krauth

Electron. J. Comb., 2006

Perfect Matching Preservers.

[BibT_eX]

[DOI]

Richard A. Brualdi

Ondrej Pangrác

Electron. J. Comb., 2006

2005

The Edmonds-Gallai Decomposition for the k-Piece Packing Problem.

[BibT_eX]

[DOI]

Marek Janata

Jácint Szabó

Electron. J. Comb., 2005

Random Walks And The Colored Jones Function.

[BibT_eX]

[DOI]

Stavros Garoufalidis

Comb., 2005

2004

Triangles in random graphs.

[BibT_eX]

[DOI]

Jirí Matousek

Ondrej Pangrác

Discret. Math., 2004

Ground State Incongruence in 2D Spin Glasses Revisited.

[BibT_eX]

[DOI]

Electron. J. Comb., 2004

Expected Length of the Longest Common Subsequence for Large Alphabets.

[BibT_eX]

[DOI]

Jirí Matousek

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003

Towards a theory of frustrated degeneracy.

[BibT_eX]

[DOI]

Jan Vondrák

Discret. Math., 2003

A note on random homomorphism from arbitrary graphs to Z.

[BibT_eX]

[DOI]

Bruce A. Reed

Discret. Math., 2003

2002

Largest planar matching in random bipartite graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2002

On the Dimer Problem and the Ising Problem in Finite 3-dimensional Lattices.

[BibT_eX]

[DOI]

Electron. J. Comb., 2002

2001

Optimization via enumeration: a new algorithm for the Max Cut Problem.

[BibT_eX]

[DOI]

Jan Vondrák

Math. Program., 2001

A note on Random Homomorphism from ArbitraryGraphs to Z.

[BibT_eX]

[DOI]

Bruce A. Reed

Electron. Notes Discret. Math., 2001

Some remarks on cycles in graphs and digraphs.

[BibT_eX]

[DOI]

Martín Matamala

Discret. Math., 2001

A Discrete Non-Pfaffian Approach to the Ising Problem.

[BibT_eX]

[DOI]

Proceedings of the Graphs, 2001

1999

Cycle Bases for Lattices of Binary Matroids with No Fano Dual Minor and Their One-Element Extensions.

[BibT_eX]

[DOI]

Tamás Fleiner

Winfried Hochstättler

Monique Laurent

J. Comb. Theory B, 1999

On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration.

[BibT_eX]

[DOI]

Electron. J. Comb., 1999

On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents.

[BibT_eX]

[DOI]

Electron. J. Comb., 1999

1998

Even Directed Cycles in <i>H</i>-Free Digraphs.

[BibT_eX]

[DOI]

J. Algorithms, 1998

1997

Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder.

[BibT_eX]

[DOI]

J. Algorithms, 1997

On Defect Sets in Bipartite Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Penny E. Haxell

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Bases of cocycle lattices and submatrices of a Hadamard matrix.

[BibT_eX]

[DOI]

Winfried Hochstättler

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996

(<i>p, q</i>)-odd digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

Cycles of Prescribed Modularity in Planar Digraphs.

[BibT_eX]

[DOI]

J. Algorithms, 1996

Generating convex polyominoes at random.

[BibT_eX]

[DOI]

Winfried Hochstättler

Christoph Moll

Discret. Math., 1996

Jordan Graphs.

[BibT_eX]

[DOI]

Ron Aharoni

Gabor T. Herman

CVGIP Graph. Model. Image Process., 1996

1995

Complexity of circuit intersection in graphs.

[BibT_eX]

[DOI]

Aviezri S. Fraenkel

Discret. Math., 1995

1993

Efficient Subgraph Packing.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1993

Gadget classification.

[BibT_eX]

[DOI]

Graphs Comb., 1993

1992

Unprovable combinatorial statements.

[BibT_eX]

[DOI]

Discret. Math., 1992

A decomposition of strongly unimodular matrices into incidence matrices of diagraphs.

[BibT_eX]

[DOI]

Yves Crama

Discret. Math., 1992

1991

Efficient Maximal Cubic Graph Cuts (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990

Greedy Compression Systems.

[BibT_eX]

[DOI]

Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

1989

A hierarchy of totally unimodular matrices.

[BibT_eX]

[DOI]

Discret. Math., 1989

1988

On matroids induced by packing subgraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1988

Epidemiography II. Games with a dozing yet winning player.

[BibT_eX]

[DOI]

Aviezri S. Fraenkel

J. Comb. Theory A, 1988

Linearity and Unprovability of Set Union Problem Strategies

[BibT_eX]

[DOI]

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Postorder Hierarchy for Path Compressions and Set Union.

[BibT_eX]

[DOI]