dblp.uni-trier.dewww.uni-trier.de

Martin Loebl

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
36EELukas Kencl, Martin Loebl: DNA-Inspired Information Concealing CoRR abs/0904.4449: (2009)
2008
35EEMartin Loebl, Lenka Zdeborová: The 3D Dimer and Ising problems revisited. Eur. J. Comb. 29(4): 966-978 (2008)
2006
34EEWerner Krauth, Martin Loebl: Jamming and Geometric Representations of Graphs. Electr. J. Comb. 13(1): (2006)
33EERichard A. Brualdi, Martin Loebl, Ondrej Pangrác: Perfect Matching Preservers. Electr. J. Comb. 13(1): (2006)
2005
32EEStavros Garoufalidis, Martin Loebl: Random Walks And The Colored Jones Function. Combinatorica 25(6): 651-671 (2005)
31EEMarek Janata, Martin Loebl, Jácint Szabó: The Edmonds-Gallai Decomposition for the k-Piece Packing Problem. Electr. J. Comb. 12: (2005)
2004
30EEMarcos A. Kiwi, Martin Loebl, Jirí Matousek: Expected Length of the Longest Common Subsequence for Large Alphabets. LATIN 2004: 302-311
29EEMartin Loebl, Jirí Matousek, Ondrej Pangrác: Triangles in random graphs. Discrete Mathematics 289(1-3): 181-185 (2004)
28EEMartin Loebl: Ground State Incongruence in 2D Spin Glasses Revisited. Electr. J. Comb. 11(1): (2004)
2003
27EEMartin Loebl, Jan Vondrák: Towards a theory of frustrated degeneracy. Discrete Mathematics 271(1-3): 179-193 (2003)
26EEMartin 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
25EEMartin Loebl: On the Dimer Problem and the Ising Problem in Finite 3-dimensional Lattices. Electr. J. Comb. 9(1): (2002)
24EEMarcos A. Kiwi, Martin Loebl: Largest planar matching in random bipartite graphs. Random Struct. Algorithms 21(2): 162-181 (2002)
2001
23EEMartin Loebl, Martín Matamala: Some remarks on cycles in graphs and digraphs. Discrete Mathematics 233(1-3): 175-182 (2001)
22EEMartin 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
21EEAnna Galluccio, Martin Loebl: On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents. Electr. J. Comb. 6: (1999)
20EEAnna Galluccio, Martin Loebl: On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration. Electr. J. Comb. 6: (1999)
19EETamá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)
14EEWinfried 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
12EEAviezri 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
10EEMartin Loebl, Svatopluk Poljak: Efficient Subgraph Packing. J. Comb. Theory, Ser. B 59(1): 106-121 (1993)
1992
9EEY. Crama, Martin Loebl, Svatopluk Poljak: A decomposition of strongly unimodular matrices into incidence matrices of diagraphs. Discrete Mathematics 102(2): 143-147 (1992)
8EEMartin 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
5EEMartin 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
2EEAviezri 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)
1EEMartin Loebl, Svatopluk Poljak: On matroids induced by packing subgraphs. J. Comb. Theory, Ser. B 44(3): 338-354 (1988)

Coauthor Index

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

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)