On the theory of Pfaffian orientations. I. Perfect matchings and permanents A Galluccio, M Loebl the electronic journal of combinatorics, R6-R6, 1999 | 147 | 1999 |

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 | 85 | 2000 |

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 | 67 | 2005 |

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 | 61 | 1995 |

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 | 47 | 2013 |

Efficient subgraph packing M Loebl, S Poljak Journal of Combinatorial Theory, Series B 59 (1), 106-121, 1993 | 44 | 1993 |

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 | 40 | 1999 |

Generating convex polyominoes at random W Hochstättler, M Loebl, C Moll Discrete Mathematics 153 (1-3), 165-176, 1996 | 40 | 1996 |

Optimization via enumeration: a new algorithm for the max cut problem A Galluccio, M Loebl, J Vondrák Mathematical Programming 90 (2), 273-290, 2001 | 39 | 2001 |

The chromatic polynomial of fatgraphs and its categorification M Loebl, I Moffatt Advances in Mathematics 217 (4), 1558-1587, 2008 | 35 | 2008 |

On undecidability of the weakened Kruskal theorem M Loebl, J Matoušek Department of Applied Mathematics, Charles University, 1986 | 35 | 1986 |

Discrete mathematics in statistical physics M Loebl Vieweg+ Teubner, 13, 2010 | 31 | 2010 |

On matroids induced by packing subgraphs M Loebl, S Poljak Journal of Combinatorial Theory, Series B 44 (3), 338-354, 1988 | 31 | 1988 |

An unprovable Ramsey-type theorem M Loebl, J Nešetřil Proceedings of the American Mathematical Society 116 (3), 819-824, 1992 | 25 | 1992 |

On the optimality of the Arf invariant formula for graph polynomials M Loebl, G Masbaum arXiv preprint arXiv:0908.2925, 2009 | 23 | 2009 |

Subgraph packing—a survey M Loebl, S Poljak Topics in Combinatorics and Graph Theory, 491-503, 1990 | 23 | 1990 |

A note on random homomorphism from arbitrary graphs to Z M Loebl, J Nešetřil, B Reed Discrete mathematics 273 (1-3), 173-181, 2003 | 19 | 2003 |

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 | 19 | 1988 |

Almost All F-Free Graphs Have The Erdös-Hajnal Property M Loebl, B Reed, A Scott, A Thomason, S Thomassé An irregular mind, 405-414, 2010 | 18 | 2010 |

Jordan graphs R Aharoni, GT Herman, M Loebl Graphical Models and Image Processing 58 (4), 345-359, 1996 | 18 | 1996 |