Martin Loebl

Publication Activity (10 Years)

Years Active: 1988-2024
Publications (10 Years): 11

Top Topics

Uniformly Distributed

Qos Multicast Routing

Shows A Significant Improvement

Top Venues

Discret. Optim.

Electron. J. Comb.

Publications

Jan Kratochvíl, Martin Loebl, Jaroslav Nesetril
Preface: Czech-Slovak Graph Theory in honor of Robin Thomas. Discret. Math. 347 (9) (2024)
David Sychrovsky, Jakub Cerný, Sylvain Lichau, Martin Loebl
Price of Anarchy in a Double-Sided Critical Distribution System. AAMAS (2023)
David Sychrovsky, Sameer Desai, Martin Loebl
Promoting Non-Cooperation Through Ordering. CoRR (2023)
David Sychrovsky, Jakub Cerný, Sylvain Lichau, Martin Loebl
Price of Anarchy in a Double-Sided Critical Distribution System. CoRR (2023)
Anetta Jedlickova, Martin Loebl, David Szchrovsky
Critical Distribution System. CoRR (2022)
Jirí Fink, Martin Loebl, Petra Pelikánová
Arc-routing for winter road maintenance. Discret. Optim. 41 (2021)
Jirí Fink, Martin Loebl
Arc-routing for winter road maintenance. CoRR (2020)
Jirí Fink, Martin Loebl, Petra Pelikánová
A New Arc-Routing Algorithm Applied to Winter Road Maintenance. CoRR (2020)
Martin Loebl
The Precise Complexity of Finding Rainbow Even Matchings. CAI (2019)
Martin Loebl, Pavel Rytír
Binary linear codes, dimers and hypermatrices. Electron. Notes Discret. Math. 59 (2017)
Andrea Jiménez, Mihyun Kang, Martin Loebl
Cubic Bridgeless Graphs and Braces. Graphs Comb. 32 (6) (2016)
Martin Loebl, Petr Somberg
Discrete Dirac Operators, Critical Embeddings and Ihara-Selberg Functions. Electron. J. Comb. 22 (1) (2015)
Andrea Jiménez, Martin Loebl
Directed cycle double covers and cut-obstacles. CoRR (2014)
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) (2013)
Hossein Teimoori Faal, Martin Loebl
Bass' identity and a coin arrangements lemma. Eur. J. Comb. 33 (5) (2012)
Martin Loebl, Iain Moffatt
A permanent formula for the Jones polynomial. Adv. Appl. Math. 47 (4) (2011)
Andrea Jiménez, Marcos A. Kiwi, Martin Loebl
Satisfying States of Triangulations of a Convex n-gon. Electron. J. Comb. 17 (1) (2010)
Lukas Kencl, Martin Loebl
DNA-inspired information concealing: A survey. Comput. Sci. Rev. 4 (4) (2010)
Lukas Kencl, Martin Loebl
DNA-Inspired Information Concealing CoRR (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. Electron. J. Comb. 15 (1) (2008)
Martin Loebl, Lenka Zdeborová
The 3D Dimer and Ising problems revisited. Eur. J. Comb. 29 (4) (2008)
Richard A. Brualdi, Martin Loebl, Ondrej Pangrác
Perfect Matching Preservers. Electron. J. Comb. 13 (1) (2006)
Werner Krauth, Martin Loebl
Jamming and Geometric Representations of Graphs. Electron. J. Comb. 13 (1) (2006)
Stavros Garoufalidis, Martin Loebl
Random Walks And The Colored Jones Function. Comb. 25 (6) (2005)
Marek Janata, Martin Loebl, Jácint Szabó
The Edmonds-Gallai Decomposition for the k-Piece Packing Problem. Electron. J. Comb. 12 (2005)
Martin Loebl, Jirí Matousek, Ondrej Pangrác
Triangles in random graphs. Discret. Math. 289 (1-3) (2004)
Marcos A. Kiwi, Martin Loebl, Jirí Matousek
Expected Length of the Longest Common Subsequence for Large Alphabets. LATIN (2004)
Martin Loebl
Ground State Incongruence in 2D Spin Glasses Revisited. Electron. J. Comb. 11 (1) (2004)
Martin Loebl, Jaroslav Nesetril, Bruce A. Reed
A note on random homomorphism from arbitrary graphs to Z. Discret. Math. 273 (1-3) (2003)
Martin Loebl, Jan Vondrák
Towards a theory of frustrated degeneracy. Discret. Math. 271 (1-3) (2003)
Martin Loebl
On the Dimer Problem and the Ising Problem in Finite 3-dimensional Lattices. Electron. J. Comb. 9 (1) (2002)
Marcos A. Kiwi, Martin Loebl
Largest planar matching in random bipartite graphs. Random Struct. Algorithms 21 (2) (2002)
Anna Galluccio, Martin Loebl, Jan Vondrák
Optimization via enumeration: a new algorithm for the Max Cut Problem. Math. Program. 90 (2) (2001)
Martin Loebl
A Discrete Non-Pfaffian Approach to the Ising Problem. Graphs, Morphisms and Statistical Physics (2001)
Martin Loebl, Martín Matamala
Some remarks on cycles in graphs and digraphs. Discret. Math. 233 (1-3) (2001)
Martin Loebl, Jaroslav Nesetril, Bruce A. Reed
A note on Random Homomorphism from ArbitraryGraphs to Z. Electron. Notes Discret. Math. 10 (2001)
Anna Galluccio, Martin Loebl
On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents. Electron. 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) (1999)
Anna Galluccio, Martin Loebl
On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration. Electron. J. Comb. 6 (1999)
Anna Galluccio, Martin Loebl
-Free Digraphs. J. Algorithms 27 (1) (1998)
Winfried Hochstättler, Martin Loebl
Bases of cocycle lattices and submatrices of a Hadamard matrix. Contemporary Trends in Discrete Mathematics (1997)
Martin Loebl, Jaroslav Nesetril
Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder. J. Algorithms 23 (2) (1997)
Penny E. Haxell, Martin Loebl
On Defect Sets in Bipartite Graphs (Extended Abstract). ISAAC (1997)
Ron Aharoni, Gabor T. Herman, Martin Loebl
Jordan Graphs. CVGIP Graph. Model. Image Process. 58 (4) (1996)
Anna Galluccio, Martin Loebl
Cycles of Prescribed Modularity in Planar Digraphs. J. Algorithms 21 (1) (1996)
Anna Galluccio, Martin Loebl
)-odd digraphs. J. Graph Theory 23 (2) (1996)
Winfried Hochstättler, Martin Loebl, Christoph Moll
Generating convex polyominoes at random. Discret. Math. 153 (1-3) (1996)
Aviezri S. Fraenkel, Martin Loebl
Complexity of circuit intersection in graphs. Discret. Math. 141 (1-3) (1995)
Martin Loebl, Svatopluk Poljak
Efficient Subgraph Packing. J. Comb. Theory, Ser. B 59 (1) (1993)
Martin Loebl
Gadget classification. Graphs Comb. 9 (1) (1993)
Anna Galluccio, Martin Loebl
Cycles of prescribed modularity in planar digraphs. IPCO (1993)
Martin Loebl
Unprovable combinatorial statements. Discret. Math. 108 (1-3) (1992)
Yves Crama, Martin Loebl, Svatopluk Poljak
A decomposition of strongly unimodular matrices into incidence matrices of diagraphs. Discret. Math. 102 (2) (1992)
Martin Loebl
Efficient Maximal Cubic Graph Cuts (Extended Abstract). ICALP (1991)
Martin Loebl
Greedy Compression Systems. IMYCS (1990)
Martin Loebl, Svatopluk Poljak
A hierarchy of totally unimodular matrices. Discret. Math. 76 (3) (1989)
Aviezri S. Fraenkel, Martin Loebl, Jaroslav Nesetril
Epidemiography II. Games with a dozing yet winning player. J. Comb. Theory, Ser. A 49 (1) (1988)
Martin Loebl, Jaroslav Nesetril
Postorder Hierarchy for Path Compressions and Set Union. IMYCS (1988)
Martin Loebl, Svatopluk Poljak
On matroids induced by packing subgraphs. J. Comb. Theory, Ser. B 44 (3) (1988)
Martin Loebl, Jaroslav Nesetril
Linearity and Unprovability of Set Union Problem Strategies STOC (1988)