Search the dblp DataBase
Martin Loebl :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Martin Loebl Efficient Maximal Cubic Graph Cuts (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ICALP, 1991, pp:351-362 [Conf ] Martin Loebl Greedy Compression Systems. [Citation Graph (0, 0)][DBLP ] IMYCS, 1990, pp:169-176 [Conf ] Martin Loebl , Jaroslav Nesetril Postorder Hierarchy for Path Compressions and Set Union. [Citation Graph (0, 0)][DBLP ] IMYCS, 1988, pp:146-151 [Conf ] Anna Galluccio , Martin Loebl Cycles of prescribed modularity in planar digraphs. [Citation Graph (0, 0)][DBLP ] IPCO, 1993, pp:113-127 [Conf ] Penny E. Haxell , Martin Loebl On Defect Sets in Bipartite Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ISAAC, 1997, pp:334-343 [Conf ] Marcos A. Kiwi , Martin Loebl , Jirí Matousek Expected Length of the Longest Common Subsequence for Large Alphabets. [Citation Graph (0, 0)][DBLP ] LATIN, 2004, pp:302-311 [Conf ] Martin Loebl , Jaroslav Nesetril Linearity and Unprovability of Set Union Problem Strategies [Citation Graph (0, 0)][DBLP ] STOC, 1988, pp:360-366 [Conf ] Stavros Garoufalidis , Martin Loebl Random Walks And The Colored Jones Function. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2005, v:25, n:6, pp:651-671 [Journal ] Anna Galluccio , Martin Loebl On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 1999, v:6, n:, pp:- [Journal ] Anna Galluccio , Martin Loebl On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 1999, v:6, n:, pp:- [Journal ] Martin Loebl On the Dimer Problem and the Ising Problem in Finite 3-dimensional Lattices. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal ] Martin Loebl Ground State Incongruence in 2D Spin Glasses Revisited. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal ] Ron Aharoni , Gabor T. Herman , Martin Loebl Jordan Graphs. [Citation Graph (0, 0)][DBLP ] CVGIP: Graphical Model and Image Processing, 1996, v:58, n:4, pp:345-359 [Journal ] Martin Loebl , Martín Matamala Some remarks on cycles in graphs and digraphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:233, n:1-3, pp:175-182 [Journal ] Martin Loebl , Jirí Matousek , Ondrej Pangrác Triangles in random graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:289, n:1-3, pp:181-185 [Journal ] Martin Loebl , Jaroslav Nesetril , Bruce A. Reed A note on random homomorphism from arbitrary graphs to Z. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2003, v:273, n:1-3, pp:173-181 [Journal ] Martin Loebl , Jan Vondrák Towards a theory of frustrated degeneracy. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2003, v:271, n:1-3, pp:179-193 [Journal ] Anna Galluccio , Martin Loebl Cycles of Prescribed Modularity in Planar Digraphs. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1996, v:21, n:1, pp:51-70 [Journal ] Anna Galluccio , Martin Loebl Even Directed Cycles in H -Free Digraphs. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1998, v:27, n:1, pp:26-41 [Journal ] Martin Loebl , Jaroslav Nesetril Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:23, n:2, pp:207-220 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1999, v:77, n:1, pp:25-38 [Journal ] Aviezri S. Fraenkel , Martin Loebl , Jaroslav Nesetril Epidemiography II. Games with a dozing yet winning player. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1988, v:49, n:1, pp:129-144 [Journal ] Martin Loebl , Svatopluk Poljak On matroids induced by packing subgraphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1988, v:44, n:3, pp:338-354 [Journal ] Martin Loebl , Svatopluk Poljak Efficient Subgraph Packing. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1993, v:59, n:1, pp:106-121 [Journal ] Marcos A. Kiwi , Martin Loebl Largest planar matching in random bipartite graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2002, v:21, n:2, pp:162-181 [Journal ] Martin Loebl , Svatopluk Poljak A hierarchy of totally unimodular matrices. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1989, v:76, n:3, pp:241-246 [Journal ] Y. Crama , Martin Loebl , Svatopluk Poljak A decomposition of strongly unimodular matrices into incidence matrices of diagraphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1992, v:102, n:2, pp:143-147 [Journal ] Martin Loebl Unprovable combinatorial statements. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1992, v:108, n:1-3, pp:333-342 [Journal ] Aviezri S. Fraenkel , Martin Loebl Complexity of circuit intersection in graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1995, v:141, n:1-3, pp:135-151 [Journal ] Winfried Hochstättler , Martin Loebl , Christoph Moll Generating convex polyominoes at random. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:153, n:1-3, pp:165-176 [Journal ] The Edmonds-Gallai Decomposition for the k-Piece Packing Problem. [Citation Graph (, )][DBLP ] Jamming and Geometric Representations of Graphs. [Citation Graph (, )][DBLP ] Perfect Matching Preservers. [Citation Graph (, )][DBLP ] DNA-Inspired Information Concealing [Citation Graph (, )][DBLP ] The 3D Dimer and Ising problems revisited. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.304secs