Follow
Martin Loebl
Martin Loebl
Professor of Informatics, Charles University, Prague
Verified email at kam.mff.cuni.cz
Title
Cited by
Cited by
Year
On the theory of Pfaffian orientations. I. Perfect matchings and permanents
A Galluccio, M Loebl
the electronic journal of combinatorics, R6-R6, 1999
1661999
New algorithm for the Ising problem: Partition function for finite lattice graphs
A Galluccio, M Loebl, J Vondrák
Physical Review Letters 84 (26), 5924, 2000
952000
Tournaments and colouring
E Berger, K Choromanski, M Chudnovsky, J Fox, M Loebl, A Scott, ...
Journal of Combinatorial Theory, Series B 103 (1), 1-20, 2013
752013
Expected length of the longest common subsequence for large alphabets
M Kiwi, M Loebl, J Matoušek
Advances in Mathematics 197 (2), 480-498, 2005
752005
Discrepancy of trees
P Erdős, Z Füredi, M Loebl, V T Sós
Studia Scientiarum Mathematicarum Hungarica 30 (1-2), 47-57, 1995
721995
Optimization via enumeration: a new algorithm for the max cut problem
A Galluccio, M Loebl, J Vondrák
Mathematical Programming 90, 273-290, 2001
532001
On the Theory of Pfaffian Orientations. II. -joins, -cuts, and Duality of Enumeration
A Galluccio, M Loebl
the electronic journal of combinatorics, R7-R7, 1999
51*1999
Efficient subgraph packing
M Loebl, S Poljak
Journal of Combinatorial Theory, Series B 59 (1), 106-121, 1993
441993
The chromatic polynomial of fatgraphs and its categorification
M Loebl, I Moffatt
Advances in Mathematics 217 (4), 1558-1587, 2008
412008
Generating convex polyominoes at random
W Hochstättler, M Loebl, C Moll
Discrete Mathematics 153 (1-3), 165-176, 1996
401996
On undecidability of the weakened Kruskal theorem
M Loebl, J Matoušek
Department of Applied Mathematics, Charles University, 1986
371986
On matroids induced by packing subgraphs
M Loebl, S Poljak
Journal of Combinatorial Theory, Series B 44 (3), 338-354, 1988
361988
Discrete mathematics in statistical physics
M Loebl
vieweg+ tuebner, 2010
352010
Linearity and unprovability of set union problem
M Loebl, J Nešetřil
Proceedings of the twentieth annual ACM symposium on Theory of computing …, 1988
351988
Isomorphism of weighted trees and Stanley's isomorphism conjecture for caterpillars
M Loebl, JS Sereni
Annales de l’institut Henri Poincaré D 6 (3), 357-384, 2019
302019
An unprovable Ramsey-type theorem
M Loebl, J Nešetřil
Proceedings of the American Mathematical Society 116 (3), 819-824, 1992
281992
On the optimality of the Arf invariant formula for graph polynomials
M Loebl, G Masbaum
arXiv preprint arXiv:0908.2925, 2009
252009
Subgraph packing—a survey
M Loebl, S Poljak
Topics in combinatorics and graph theory: Essays in honour of Gerhard Ringel …, 1990
241990
Epidemiography II. Games with a dozing yet winning player
AS Fraenkel, M Loebl, J Nešetřil
Journal of Combinatorial Theory, Series A 49 (1), 129-144, 1988
211988
Almost All F-Free Graphs Have The Erdös-Hajnal Property
M Loebl, B Reed, A Scott, A Thomason, S Thomassé
An Irregular Mind: Szemerédi is 70, 405-414, 2010
202010
The system can't perform the operation now. Try again later.
Articles 1–20