2008 |
15 | EE | Felix G. König,
Marco E. Lübbecke:
Sorting with Complete Networks of Stacks.
ISAAC 2008: 895-906 |
14 | EE | Gerald Lach,
Marco E. Lübbecke:
Optimal University Course Timetables and the Partial Transversal Polytope.
WEA 2008: 235-248 |
13 | EE | Sándor P. Fekete,
Marco E. Lübbecke,
Henk Meijer:
Minimizing the Stabbing Number of Matchings, Trees, and Triangulations.
Discrete & Computational Geometry 40(4): 595-621 (2008) |
12 | EE | Stefan Felsner,
Marco E. Lübbecke,
Jarik Nesetril:
Preface.
Discrete Mathematics 308(8): 1347-1349 (2008) |
11 | EE | Gabriele Di Stefano,
Stefan Krause,
Marco E. Lübbecke,
Uwe T. Zimmermann:
On minimum k-modal partitions of permutations.
J. Discrete Algorithms 6(3): 381-392 (2008) |
2007 |
10 | EE | Felix G. König,
Marco E. Lübbecke,
Rolf H. Möhring,
Guido Schäfer,
Ines Spenke:
Solutions to Real-World Instances of PSPACE-Complete Stacking.
ESA 2007: 729-740 |
9 | EE | Stefan Felsner,
Marco E. Lübbecke,
Jarik Nesetril:
Editorial.
Eur. J. Comb. 28(8): 2053-2056 (2007) |
2006 |
8 | EE | Gabriele Di Stefano,
Stefan Krause,
Marco E. Lübbecke,
Uwe T. Zimmermann:
On Minimum k-Modal Partitions of Permutations.
LATIN 2006: 374-385 |
7 | EE | Laura Heinrich-Litan,
Marco E. Lübbecke:
Rectangle covers revisited computationally.
ACM Journal of Experimental Algorithmics 11: (2006) |
2005 |
6 | EE | Laura Heinrich-Litan,
Marco E. Lübbecke:
Rectangle Covers Revisited Computationally.
WEA 2005: 55-66 |
5 | EE | Daniel Villeneuve,
Jacques Desrosiers,
Marco E. Lübbecke,
François Soumis:
On Compact Formulations for Integer Programs Solved by Column Generation.
Annals OR 139(1): 375-388 (2005) |
4 | EE | Marco E. Lübbecke:
Dual variable based fathoming in dynamic programs for column generation.
European Journal of Operational Research 162(1): 122-125 (2005) |
2004 |
3 | EE | Sándor P. Fekete,
Marco E. Lübbecke,
Henk Meijer:
Minimizing the stabbing number of matchings, trees, and triangulations.
SODA 2004: 437-446 |
2003 |
2 | EE | Sándor P. Fekete,
Marco E. Lübbecke,
Henk Meijer:
Minimizing the stabbing number of matchings, trees, and triangulations
CoRR cs.CG/0310034: (2003) |
1998 |
1 | | Michael R. Bussieck,
Marco E. Lübbecke:
The vertex set of a 0/1-polytope is strongly P-enumerable.
Comput. Geom. 11(2): 103-109 (1998) |