default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Loebl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j42]Jan Kratochvíl, Martin Loebl, Jaroslav Nesetril:
Preface: Czech-Slovak Graph Theory in honor of Robin Thomas. Discret. Math. 347(9): 114066 (2024)- 2023
- [c12]David Sychrovsky, Jakub Cerný, Sylvain Lichau, Martin Loebl:
Price of Anarchy in a Double-Sided Critical Distribution System. AAMAS 2023: 582-590 - [c11]David Sychrovsky
, Sameer Desai, Martin Loebl:
Rule Enforcing Through Ordering. GameSec 2023: 43-62 - [i7]David Sychrovsky, Jakub Cerný, Sylvain Lichau, Martin Loebl:
Price of Anarchy in a Double-Sided Critical Distribution System. CoRR abs/2302.09959 (2023) - [i6]David Sychrovsky, Sameer Desai, Martin Loebl:
Promoting Non-Cooperation Through Ordering. CoRR abs/2303.17971 (2023) - 2022
- [i5]Anetta Jedlickova, Martin Loebl, David Sychrovsky:
Critical Distribution System. CoRR abs/2207.00898 (2022) - 2021
- [j41]Jirí Fink, Martin Loebl, Petra Pelikánová:
Arc-routing for winter road maintenance. Discret. Optim. 41: 100644 (2021) - 2020
- [i4]Jirí Fink, Martin Loebl:
Arc-routing for winter road maintenance. CoRR abs/2001.08416 (2020) - [i3]Jirí Fink, Martin Loebl, Petra Pelikánová:
A New Arc-Routing Algorithm Applied to Winter Road Maintenance. CoRR abs/2001.10828 (2020)
2010 – 2019
- 2019
- [c10]Martin Loebl:
The Precise Complexity of Finding Rainbow Even Matchings. CAI 2019: 190-201 - 2017
- [j40]Martin Loebl, Pavel Rytír:
Binary linear codes, dimers and hypermatrices. Electron. Notes Discret. Math. 59: 19-35 (2017) - 2016
- [j39]Andrea Jiménez, Mihyun Kang, Martin Loebl:
Cubic Bridgeless Graphs and Braces. Graphs Comb. 32(6): 2473-2495 (2016) - 2015
- [j38]Martin Loebl, Petr Somberg:
Discrete Dirac Operators, Critical Embeddings and Ihara-Selberg Functions. Electron. J. Comb. 22(1): 1 (2015) - 2014
- [i2]Andrea Jiménez, Martin Loebl:
Directed cycle double covers and cut-obstacles. CoRR abs/1405.6929 (2014) - 2013
- [j37]Eli Berger, Krzysztof Choromanski, Maria Chudnovsky, Jacob Fox, Martin Loebl, Alex Scott, Paul D. Seymour, Stéphan Thomassé:
Tournaments and colouring. J. Comb. Theory B 103(1): 1-20 (2013) - 2012
- [j36]Hossein Teimoori Faal, Martin Loebl:
Bass' identity and a coin arrangements lemma. Eur. J. Comb. 33(5): 736-742 (2012) - 2011
- [j35]Martin Loebl, Iain Moffatt:
A permanent formula for the Jones polynomial. Adv. Appl. Math. 47(4): 659-667 (2011) - 2010
- [j34]Andrea Jiménez, Marcos A. Kiwi, Martin Loebl:
Satisfying States of Triangulations of a Convex n-gon. Electron. J. Comb. 17(1) (2010) - [j33]Lukas Kencl, Martin Loebl:
DNA-inspired information concealing: A survey. Comput. Sci. Rev. 4(4): 251-262 (2010)
2000 – 2009
- 2009
- [b1]Martin Loebl:
Discrete Mathematics in Statistical Physics - Introductory Lectures. Advanced lectures in mathematics, Vieweg 2009, ISBN 978-3-528-03219-7, pp. I-X, 1-187 - [i1]Lukas Kencl, Martin Loebl:
DNA-Inspired Information Concealing. CoRR abs/0904.4449 (2009) - 2008
- [j32]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) - [j31]Martin Loebl, Lenka Zdeborová:
The 3D Dimer and Ising problems revisited. Eur. J. Comb. 29(4): 966-978 (2008) - 2006
- [j30]Richard A. Brualdi, Martin Loebl, Ondrej Pangrác:
Perfect Matching Preservers. Electron. J. Comb. 13(1) (2006) - [j29]Werner Krauth, Martin Loebl:
Jamming and Geometric Representations of Graphs. Electron. J. Comb. 13(1) (2006) - 2005
- [j28]Stavros Garoufalidis, Martin Loebl:
Random Walks And The Colored Jones Function. Comb. 25(6): 651-671 (2005) - [j27]Marek Janata, Martin Loebl, Jácint Szabó:
The Edmonds-Gallai Decomposition for the k-Piece Packing Problem. Electron. J. Comb. 12 (2005) - 2004
- [j26]Martin Loebl:
Ground State Incongruence in 2D Spin Glasses Revisited. Electron. J. Comb. 11(1) (2004) - [j25]Martin Loebl, Jirí Matousek, Ondrej Pangrác:
Triangles in random graphs. Discret. Math. 289(1-3): 181-185 (2004) - [c9]Marcos A. Kiwi, Martin Loebl, Jirí Matousek:
Expected Length of the Longest Common Subsequence for Large Alphabets. LATIN 2004: 302-311 - 2003
- [j24]Martin Loebl, Jan Vondrák:
Towards a theory of frustrated degeneracy. Discret. Math. 271(1-3): 179-193 (2003) - [j23]Martin Loebl, Jaroslav Nesetril, Bruce A. Reed:
A note on random homomorphism from arbitrary graphs to Z. Discret. Math. 273(1-3): 173-181 (2003) - 2002
- [j22]Martin Loebl:
On the Dimer Problem and the Ising Problem in Finite 3-dimensional Lattices. Electron. J. Comb. 9(1) (2002) - [j21]Marcos A. Kiwi, Martin Loebl:
Largest planar matching in random bipartite graphs. Random Struct. Algorithms 21(2): 162-181 (2002) - 2001
- [j20]Martin Loebl, Martín Matamala:
Some remarks on cycles in graphs and digraphs. Discret. Math. 233(1-3): 175-182 (2001) - [j19]Martin Loebl, Jaroslav Nesetril, Bruce A. Reed:
A note on Random Homomorphism from ArbitraryGraphs to Z. Electron. Notes Discret. Math. 10: 176-180 (2001) - [j18]Anna Galluccio, Martin Loebl, Jan Vondrák:
Optimization via enumeration: a new algorithm for the Max Cut Problem. Math. Program. 90(2): 273-290 (2001) - [c8]Martin Loebl:
A Discrete Non-Pfaffian Approach to the Ising Problem. Graphs, Morphisms and Statistical Physics 2001: 145-154
1990 – 1999
- 1999
- [j17]Anna Galluccio, Martin Loebl:
On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents. Electron. J. Comb. 6 (1999) - [j16]Anna Galluccio, Martin Loebl:
On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration. Electron. J. Comb. 6 (1999) - [j15]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 B 77(1): 25-38 (1999) - 1998
- [j14]Anna Galluccio, Martin Loebl:
Even Directed Cycles in H-Free Digraphs. J. Algorithms 27(1): 26-41 (1998) - 1997
- [j13]Martin Loebl, Jaroslav Nesetril:
Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder. J. Algorithms 23(2): 207-220 (1997) - [c7]Winfried Hochstättler, Martin Loebl:
Bases of cocycle lattices and submatrices of a Hadamard matrix. Contemporary Trends in Discrete Mathematics 1997: 159-168 - [c6]Penny E. Haxell, Martin Loebl:
On Defect Sets in Bipartite Graphs (Extended Abstract). ISAAC 1997: 334-343 - 1996
- [j12]Ron Aharoni, Gabor T. Herman, Martin Loebl:
Jordan Graphs. CVGIP Graph. Model. Image Process. 58(4): 345-359 (1996) - [j11]Winfried Hochstättler, Martin Loebl, Christoph Moll:
Generating convex polyominoes at random. Discret. Math. 153(1-3): 165-176 (1996) - [j10]Anna Galluccio, Martin Loebl:
Cycles of Prescribed Modularity in Planar Digraphs. J. Algorithms 21(1): 51-70 (1996) - [j9]Anna Galluccio, Martin Loebl:
(p, q)-odd digraphs. J. Graph Theory 23(2): 175-184 (1996) - 1995
- [j8]Aviezri S. Fraenkel, Martin Loebl:
Complexity of circuit intersection in graphs. Discret. Math. 141(1-3): 135-151 (1995) - 1993
- [j7]Martin Loebl:
Gadget classification. Graphs Comb. 9(1): 57-62 (1993) - [j6]Martin Loebl, Svatopluk Poljak:
Efficient Subgraph Packing. J. Comb. Theory B 59(1): 106-121 (1993) - [c5]Anna Galluccio, Martin Loebl:
Cycles of prescribed modularity in planar digraphs. IPCO 1993: 113-127 - 1992
- [j5]Yves Crama, Martin Loebl, Svatopluk Poljak:
A decomposition of strongly unimodular matrices into incidence matrices of diagraphs. Discret. Math. 102(2): 143-147 (1992) - [j4]Martin Loebl:
Unprovable combinatorial statements. Discret. Math. 108(1-3): 333-342 (1992) - 1991
- [c4]Martin Loebl:
Efficient Maximal Cubic Graph Cuts (Extended Abstract). ICALP 1991: 351-362 - 1990
- [c3]Martin Loebl:
Greedy Compression Systems. IMYCS 1990: 169-176
1980 – 1989
- 1989
- [j3]Martin Loebl, Svatopluk Poljak:
A hierarchy of totally unimodular matrices. Discret. Math. 76(3): 241-246 (1989) - 1988
- [j2]Martin Loebl, Svatopluk Poljak:
On matroids induced by packing subgraphs. J. Comb. Theory B 44(3): 338-354 (1988) - [j1]Aviezri S. Fraenkel, Martin Loebl, Jaroslav Nesetril:
Epidemiography II. Games with a dozing yet winning player. J. Comb. Theory A 49(1): 129-144 (1988) - [c2]Martin Loebl, Jaroslav Nesetril:
Postorder Hierarchy for Path Compressions and Set Union. IMYCS 1988: 146-151 - [c1]Martin Loebl, Jaroslav Nesetril:
Linearity and Unprovability of Set Union Problem Strategies. STOC 1988: 360-366
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
