Martin Loebl

	2009
36		Lukas Kencl, Martin Loebl: DNA-Inspired Information Concealing CoRR abs/0904.4449: (2009)
	2008
35		Martin Loebl, Lenka Zdeborová: The 3D Dimer and Ising problems revisited. Eur. J. Comb. 29(4): 966-978 (2008)
	2006
34		Werner Krauth, Martin Loebl: Jamming and Geometric Representations of Graphs. Electr. J. Comb. 13(1): (2006)
33		Richard A. Brualdi, Martin Loebl, Ondrej Pangrác: Perfect Matching Preservers. Electr. J. Comb. 13(1): (2006)
	2005
32		Stavros Garoufalidis, Martin Loebl: Random Walks And The Colored Jones Function. Combinatorica 25(6): 651-671 (2005)
31		Marek Janata, Martin Loebl, Jácint Szabó: The Edmonds-Gallai Decomposition for the k-Piece Packing Problem. Electr. J. Comb. 12: (2005)
	2004
30		Marcos A. Kiwi, Martin Loebl, Jirí Matousek: Expected Length of the Longest Common Subsequence for Large Alphabets. LATIN 2004: 302-311
29		Martin Loebl, Jirí Matousek, Ondrej Pangrác: Triangles in random graphs. Discrete Mathematics 289(1-3): 181-185 (2004)
28		Martin Loebl: Ground State Incongruence in 2D Spin Glasses Revisited. Electr. J. Comb. 11(1): (2004)
	2003
27		Martin Loebl, Jan Vondrák: Towards a theory of frustrated degeneracy. Discrete Mathematics 271(1-3): 179-193 (2003)
26		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)
	2002
25		Martin Loebl: On the Dimer Problem and the Ising Problem in Finite 3-dimensional Lattices. Electr. J. Comb. 9(1): (2002)
24		Marcos A. Kiwi, Martin Loebl: Largest planar matching in random bipartite graphs. Random Struct. Algorithms 21(2): 162-181 (2002)
	2001
23		Martin Loebl, Martín Matamala: Some remarks on cycles in graphs and digraphs. Discrete Mathematics 233(1-3): 175-182 (2001)
22		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)
	1999
21		Anna Galluccio, Martin Loebl: On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents. Electr. J. Comb. 6: (1999)
20		Anna Galluccio, Martin Loebl: On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration. Electr. J. Comb. 6: (1999)
19		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)
	1998
18		Anna Galluccio, Martin Loebl: Even Directed Cycles in H-Free Digraphs. J. Algorithms 27(1): 26-41 (1998)
	1997
17		Penny E. Haxell, Martin Loebl: On Defect Sets in Bipartite Graphs (Extended Abstract). ISAAC 1997: 334-343
16		Martin Loebl, Jaroslav Nesetril: Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder. J. Algorithms 23(2): 207-220 (1997)
	1996
15		Ron Aharoni, Gabor T. Herman, Martin Loebl: Jordan Graphs. CVGIP: Graphical Model and Image Processing 58(4): 345-359 (1996)
14		Winfried Hochstättler, Martin Loebl, Christoph Moll: Generating convex polyominoes at random. Discrete Mathematics 153(1-3): 165-176 (1996)
13		Anna Galluccio, Martin Loebl: Cycles of Prescribed Modularity in Planar Digraphs. J. Algorithms 21(1): 51-70 (1996)
	1995
12		Aviezri S. Fraenkel, Martin Loebl: Complexity of circuit intersection in graphs. Discrete Mathematics 141(1-3): 135-151 (1995)
	1993
11		Anna Galluccio, Martin Loebl: Cycles of prescribed modularity in planar digraphs. IPCO 1993: 113-127
10		Martin Loebl, Svatopluk Poljak: Efficient Subgraph Packing. J. Comb. Theory, Ser. B 59(1): 106-121 (1993)
	1992
9		Y. Crama, Martin Loebl, Svatopluk Poljak: A decomposition of strongly unimodular matrices into incidence matrices of diagraphs. Discrete Mathematics 102(2): 143-147 (1992)
8		Martin Loebl: Unprovable combinatorial statements. Discrete Mathematics 108(1-3): 333-342 (1992)
	1991
7		Martin Loebl: Efficient Maximal Cubic Graph Cuts (Extended Abstract). ICALP 1991: 351-362
	1990
6		Martin Loebl: Greedy Compression Systems. IMYCS 1990: 169-176
	1989
5		Martin Loebl, Svatopluk Poljak: A hierarchy of totally unimodular matrices. Discrete Mathematics 76(3): 241-246 (1989)
	1988
4		Martin Loebl, Jaroslav Nesetril: Postorder Hierarchy for Path Compressions and Set Union. IMYCS 1988: 146-151
3		Martin Loebl, Jaroslav Nesetril: Linearity and Unprovability of Set Union Problem Strategies STOC 1988: 360-366
2		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)
1		Martin Loebl, Svatopluk Poljak: On matroids induced by packing subgraphs. J. Comb. Theory, Ser. B 44(3): 338-354 (1988)

Coauthor Index

1	Ron Aharoni	[15]
2	Richard A. Brualdi	[33]
3	Y. Crama	[9]
4	Tamás Fleiner	[19]
5	Aviezri S. Fraenkel	[2] [12]
6	Anna Galluccio	[11] [13] [18] [20] [21]
7	Stavros Garoufalidis	[32]
8	Penny E. Haxell	[17]
9	Gabor T. Herman	[15]
10	Winfried Hochstättler	[14] [19]
11	Marek Janata	[31]
12	Lukas Kencl	[36]
13	Marcos A. Kiwi	[24] [30]
14	Werner Krauth	[34]
15	Monique Laurent	[19]
16	Martín Matamala	[23]
17	Jirí Matousek	[29] [30]
18	Christoph Moll	[14]
19	Jaroslav Nesetril (Jarik Nesetril)	[2] [3] [4] [16] [22] [26]
20	Ondrej Pangrác	[29] [33]
21	Svatopluk Poljak	[1] [5] [9] [10]
22	Bruce A. Reed	[22] [26]
23	Jácint Szabó	[31]
24	Jan Vondrák	[27]
25	Lenka Zdeborová	[35]

Colors in the list of coauthors