Martin Loebl

Eli Berger, Krzysztof Choromanski, Maria Chudnovsky, Jacob Fox, Martin Loebl, Alex Scott, Paul D. Seymour, Stéphan Thomassé: Tournaments and colouring. J. Comb. Theory, Ser. B 103(1): 1-20 (2013)

Hossein Teimoori Faal, Martin Loebl: Bass' identity and a coin arrangements lemma. Eur. J. Comb. 33(5): 736-742 (2012)

Andrea Jiménez, Marcos A. Kiwi, Martin Loebl: Satisfying States of Triangulations of a Convex n-gon. Electr. J. Comb. 17(1) (2010)

Lukas Kencl, Martin Loebl: DNA-inspired information concealing: A survey. Computer Science Review 4(4): 251-262 (2010)

Lukas Kencl, Martin Loebl: DNA-Inspired Information Concealing. CoRR abs/0904.4449 (2009)

Marcos A. Kiwi, Martin Loebl: Towards the Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs. Electr. J. Comb. 15(1) (2008)

Martin Loebl, Lenka Zdeborová: The 3D Dimer and Ising problems revisited. Eur. J. Comb. 29(4): 966-978 (2008)

Richard A. Brualdi, Martin Loebl, Ondrej Pangrác: Perfect Matching Preservers. Electr. J. Comb. 13(1) (2006)

Werner Krauth, Martin Loebl: Jamming and Geometric Representations of Graphs. Electr. J. Comb. 13(1) (2006)

Stavros Garoufalidis, Martin Loebl: Random Walks And The Colored Jones Function. Combinatorica 25(6): 651-671 (2005)

Marek Janata, Martin Loebl, Jácint Szabó: The Edmonds-Gallai Decomposition for the k-Piece Packing Problem. Electr. J. Comb. 12 (2005)

Martin Loebl: Ground State Incongruence in 2D Spin Glasses Revisited. Electr. J. Comb. 11(1) (2004)

Martin Loebl, Jirí Matousek, Ondrej Pangrác: Triangles in random graphs. Discrete Mathematics 289(1-3): 181-185 (2004)

Marcos A. Kiwi, Martin Loebl, Jirí Matousek: Expected Length of the Longest Common Subsequence for Large Alphabets. LATIN 2004: 302-311

Martin Loebl, Jan Vondrák: Towards a theory of frustrated degeneracy. Discrete Mathematics 271(1-3): 179-193 (2003)

Martin Loebl, Jaroslav Nesetril, Bruce A. Reed: A note on random homomorphism from arbitrary graphs to Z. Discrete Mathematics 273(1-3): 173-181 (2003)

Martin Loebl: On the Dimer Problem and the Ising Problem in Finite 3-dimensional Lattices. Electr. J. Comb. 9(1) (2002)

Marcos A. Kiwi, Martin Loebl: Largest planar matching in random bipartite graphs. Random Struct. Algorithms 21(2): 162-181 (2002)

Martin Loebl, Martín Matamala: Some remarks on cycles in graphs and digraphs. Discrete Mathematics 233(1-3): 175-182 (2001)

Martin Loebl, Jaroslav Nesetril, Bruce A. Reed: A note on Random Homomorphism from ArbitraryGraphs to Z. Electronic Notes in Discrete Mathematics 10: 176-180 (2001)

Anna Galluccio, Martin Loebl: On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents. Electr. J. Comb. 6 (1999)

Anna Galluccio, Martin Loebl: On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration. Electr. J. Comb. 6 (1999)

Tamás Fleiner, Winfried Hochstättler, Monique Laurent, Martin Loebl: Cycle Bases for Lattices of Binary Matroids with No Fano Dual Minor and Their One-Element Extensions. J. Comb. Theory, Ser. B 77(1): 25-38 (1999)

Anna Galluccio, Martin Loebl: Even Directed Cycles in H-Free Digraphs. J. Algorithms 27(1): 26-41 (1998)

Martin Loebl, Jaroslav Nesetril: Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder. J. Algorithms 23(2): 207-220 (1997)

Penny E. Haxell, Martin Loebl: On Defect Sets in Bipartite Graphs (Extended Abstract). ISAAC 1997: 334-343

Ron Aharoni, Gabor T. Herman, Martin Loebl: Jordan Graphs. CVGIP: Graphical Model and Image Processing 58(4): 345-359 (1996)

Winfried Hochstättler, Martin Loebl, Christoph Moll: Generating convex polyominoes at random. Discrete Mathematics 153(1-3): 165-176 (1996)

Anna Galluccio, Martin Loebl: Cycles of Prescribed Modularity in Planar Digraphs. J. Algorithms 21(1): 51-70 (1996)

Anna Galluccio, Martin Loebl: (p, q)-odd digraphs. Journal of Graph Theory 23(2): 175-184 (1996)

Aviezri S. Fraenkel, Martin Loebl: Complexity of circuit intersection in graphs. Discrete Mathematics 141(1-3): 135-151 (1995)

Martin Loebl: Gadget classification. Graphs and Combinatorics 9(1): 57-62 (1993)

Martin Loebl, Svatopluk Poljak: Efficient Subgraph Packing. J. Comb. Theory, Ser. B 59(1): 106-121 (1993)

Anna Galluccio, Martin Loebl: Cycles of prescribed modularity in planar digraphs. IPCO 1993: 113-127

Yves Crama, Martin Loebl, Svatopluk Poljak: A decomposition of strongly unimodular matrices into incidence matrices of diagraphs. Discrete Mathematics 102(2): 143-147 (1992)

Martin Loebl: Unprovable combinatorial statements. Discrete Mathematics 108(1-3): 333-342 (1992)

Martin Loebl: Efficient Maximal Cubic Graph Cuts (Extended Abstract). ICALP 1991: 351-362

Martin Loebl: Greedy Compression Systems. IMYCS 1990: 169-176

Martin Loebl, Svatopluk Poljak: A hierarchy of totally unimodular matrices. Discrete Mathematics 76(3): 241-246 (1989)

Martin Loebl, Svatopluk Poljak: On matroids induced by packing subgraphs. J. Comb. Theory, Ser. B 44(3): 338-354 (1988)

Aviezri S. Fraenkel, Martin Loebl, Jaroslav Nesetril: Epidemiography II. Games with a dozing yet winning player. J. Comb. Theory, Ser. A 49(1): 129-144 (1988)

Martin Loebl, Jaroslav Nesetril: Postorder Hierarchy for Path Compressions and Set Union. IMYCS 1988: 146-151

Martin Loebl, Jaroslav Nesetril: Linearity and Unprovability of Set Union Problem Strategies. STOC 1988: 360-366