Luitpold Babel

2004
20	EE	Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov: Algorithms for on-line bin-packing problems with cardinality constraints. Discrete Applied Mathematics 143(1-3): 238-251 (2004)
2002
19	EE	Luitpold Babel, Andreas Brandstädt, Van Bang Le: Recognizing the P4-structure of claw-free graphs and a larger graph class. Discrete Mathematics & Theoretical Computer Science 5(1): 127-146 (2002)
2001
18	EE	Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov: On-Line Algorithms for Cardinality Constrained Bin Packing Problems. ISAAC 2001: 695-706
17	EE	Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu: Efficient algorithms for graphs with few P4's. Discrete Mathematics 235(1-3): 29-51 (2001)
2000
16	EE	Luitpold Babel, Gerhard J. Woeginger: Pseudo-Hamiltonian Graphs. Acta Cybern. 14(4): 553-567 (2000)
15	EE	Luitpold Babel: Recognition and Isomorphism of Tree-like P4-connected Graphs. Discrete Applied Mathematics 99(1-3): 295-315 (2000)
1999
14	EE	Luitpold Babel, Andreas Brandstädt, Van Bang Le: Recognizing the P4-structure of Bipartite Graphs. Discrete Applied Mathematics 93(2-3): 157-168 (1999)
13	EE	Luitpold Babel, Stephan Olariu: On the p-connectedness of Graphs - A Survey. Discrete Applied Mathematics 95(1-3): 11-33 (1999)
1998
12		Luitpold Babel, Stephan Olariu: Domination and Steiner Tree Problems on Graphs with Few P4S. WG 1998: 337-350
11	EE	Luitpold Babel, Stephan Olariu: On the Structure of Graphs with Few P4s. Discrete Applied Mathematics 84(1-3): 1-13 (1998)
10	EE	Luitpold Babel: Triangulating Graphs with Few P4's. Discrete Applied Mathematics 89(1-3): 45-57 (1998)
9	EE	Luitpold Babel: Tree-like P4-connected graphs. Discrete Mathematics 191(1-3): 13-23 (1998)
1997
8		Luitpold Babel, Stephan Olariu: On the Separable-Homogeneous Decomposition of Graphs (Extended Abstract). WG 1997: 25-37
7		Luitpold Babel, Gerhard J. Woeginger: Pseudo-Hamiltonian Graphs. WG 1997: 38-51
1996
6		Luitpold Babel, Stephan Olariu: A New Characterization of P4-connected Graphs. WG 1996: 17-30
5		Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer: The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs. J. Algorithms 21(3): 542-564 (1996)
1995
4		Luitpold Babel, Stephan Olariu: On the Isomorphism of Graphs with Few P4s. WG 1995: 24-36
3	EE	Luitpold Babel: Isomorphism of Chordal (6, 3) Graphs. Computing 54(4): 303-316 (1995)
1994
2		Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer: Direct Path Graph Isomorphism (Extended Abstract). WG 1994: 395-406
1	EE	Luitpold Babel, Gottfried Tinhofer: Hard-to-color Graphs for Connected Sequential Colorings. Discrete Applied Mathematics 51(1-2): 3-25 (1994)

Coauthor Index

1	Andreas Brandstädt	[14] [19]
2	Bo Chen	[18] [20]
3	Hans Kellerer	[18] [20]
4	Ton Kloks (Antonius J. J. Kloks)	[17]
5	Vladimir Kotov	[18] [20]
6	Jan Kratochvíl	[17]
7	Dieter Kratsch	[17]
8	Van Bang Le	[14] [19]
9	Haiko Müller	[17]
10	Stephan Olariu	[4] [6] [8] [11] [12] [13] [17]
11	Ilia N. Ponomarenko	[2] [5]
12	Gottfried Tinhofer	[1] [2] [5]
13	Gerhard J. Woeginger	[7] [16]

Colors in the list of coauthors