Martin Loebl

According to our database1, Martin Loebl authored at least 51 papers between 1988 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Binary linear codes, dimers and hypermatrices.
Electronic Notes in Discrete Mathematics, 2017

2016
Cubic Bridgeless Graphs and Braces.
Graphs and Combinatorics, 2016

2015
Discrete Dirac Operators, Critical Embeddings and Ihara-Selberg Functions.
Electr. J. Comb., 2015

2014
Directed cycle double covers and cut-obstacles.
CoRR, 2014

2013
Tournaments and colouring.
J. Comb. Theory, Ser. B, 2013

2012
Bass' identity and a coin arrangements lemma.
Eur. J. Comb., 2012

2010
DNA-inspired information concealing: A survey.
Computer Science Review, 2010

Satisfying States of Triangulations of a Convex n-gon.
Electr. J. Comb., 2010

2009
DNA-Inspired Information Concealing
CoRR, 2009

Discrete Mathematics in Statistical Physics - Introductory Lectures.
Advanced lectures in mathematics, Vieweg, ISBN: 978-3-528-03219-7, 2009

2008
The 3D Dimer and Ising problems revisited.
Eur. J. Comb., 2008

Towards the Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs.
Electr. J. Comb., 2008

2006
Jamming and Geometric Representations of Graphs.
Electr. J. Comb., 2006

Perfect Matching Preservers.
Electr. J. Comb., 2006

2005
The Edmonds-Gallai Decomposition for the k-Piece Packing Problem.
Electr. J. Comb., 2005

Random Walks And The Colored Jones Function.
Combinatorica, 2005

2004
Triangles in random graphs.
Discrete Mathematics, 2004

Ground State Incongruence in 2D Spin Glasses Revisited.
Electr. J. Comb., 2004

Expected Length of the Longest Common Subsequence for Large Alphabets.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003
Towards a theory of frustrated degeneracy.
Discrete Mathematics, 2003

A note on random homomorphism from arbitrary graphs to Z.
Discrete Mathematics, 2003

2002
Largest planar matching in random bipartite graphs.
Random Struct. Algorithms, 2002

On the Dimer Problem and the Ising Problem in Finite 3-dimensional Lattices.
Electr. J. Comb., 2002

2001
Optimization via enumeration: a new algorithm for the Max Cut Problem.
Math. Program., 2001

A note on Random Homomorphism from ArbitraryGraphs to Z.
Electronic Notes in Discrete Mathematics, 2001

Some remarks on cycles in graphs and digraphs.
Discrete Mathematics, 2001

A Discrete Non-Pfaffian Approach to the Ising Problem.
Proceedings of the Graphs, 2001

1999
Cycle Bases for Lattices of Binary Matroids with No Fano Dual Minor and Their One-Element Extensions.
J. Comb. Theory, Ser. B, 1999

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

On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents.
Electr. J. Comb., 1999

1998
Even Directed Cycles in H-Free Digraphs.
J. Algorithms, 1998

1997
Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder.
J. Algorithms, 1997

On Defect Sets in Bipartite Graphs (Extended Abstract).
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Bases of cocycle lattices and submatrices of a Hadamard matrix.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996
(p, q)-odd digraphs.
Journal of Graph Theory, 1996

Cycles of Prescribed Modularity in Planar Digraphs.
J. Algorithms, 1996

Generating convex polyominoes at random.
Discrete Mathematics, 1996

Jordan Graphs.
CVGIP: Graphical Model and Image Processing, 1996

1995
Complexity of circuit intersection in graphs.
Discrete Mathematics, 1995

1993
Efficient Subgraph Packing.
J. Comb. Theory, Ser. B, 1993

Gadget classification.
Graphs and Combinatorics, 1993

Cycles of prescribed modularity in planar digraphs.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

1992
Unprovable combinatorial statements.
Discrete Mathematics, 1992

A decomposition of strongly unimodular matrices into incidence matrices of diagraphs.
Discrete Mathematics, 1992

1991
Efficient Maximal Cubic Graph Cuts (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990
Greedy Compression Systems.
Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

1989
A hierarchy of totally unimodular matrices.
Discrete Mathematics, 1989

1988
On matroids induced by packing subgraphs.
J. Comb. Theory, Ser. B, 1988

Epidemiography II. Games with a dozing yet winning player.
J. Comb. Theory, Ser. A, 1988

Linearity and Unprovability of Set Union Problem Strategies
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Postorder Hierarchy for Path Compressions and Set Union.
Proceedings of the Machines, 1988


  Loading...