dblp.uni-trier.dewww.uni-trier.de

Luitpold Babel Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2004
20EELuitpold 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
19EELuitpold 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
18EELuitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov: On-Line Algorithms for Cardinality Constrained Bin Packing Problems. ISAAC 2001: 695-706
17EELuitpold 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
16EELuitpold Babel, Gerhard J. Woeginger: Pseudo-Hamiltonian Graphs. Acta Cybern. 14(4): 553-567 (2000)
15EELuitpold Babel: Recognition and Isomorphism of Tree-like P4-connected Graphs. Discrete Applied Mathematics 99(1-3): 295-315 (2000)
1999
14EELuitpold Babel, Andreas Brandstädt, Van Bang Le: Recognizing the P4-structure of Bipartite Graphs. Discrete Applied Mathematics 93(2-3): 157-168 (1999)
13EELuitpold Babel, Stephan Olariu: On the p-connectedness of Graphs - A Survey. Discrete Applied Mathematics 95(1-3): 11-33 (1999)
1998
12EELuitpold Babel, Stephan Olariu: Domination and Steiner Tree Problems on Graphs with Few P4S. WG 1998: 337-350
11EELuitpold Babel, Stephan Olariu: On the Structure of Graphs with Few P4s. Discrete Applied Mathematics 84(1-3): 1-13 (1998)
10EELuitpold Babel: Triangulating Graphs with Few P4's. Discrete Applied Mathematics 89(1-3): 45-57 (1998)
9EELuitpold Babel: Tree-like P4-connected graphs. Discrete Mathematics 191(1-3): 13-23 (1998)
1997
8EELuitpold Babel, Stephan Olariu: On the Separable-Homogeneous Decomposition of Graphs (Extended Abstract). WG 1997: 25-37
7EELuitpold Babel, Gerhard J. Woeginger: Pseudo-Hamiltonian Graphs. WG 1997: 38-51
1996
6EELuitpold 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
4EELuitpold Babel, Stephan Olariu: On the Isomorphism of Graphs with Few P4s. WG 1995: 24-36
3EELuitpold Babel: Isomorphism of Chordal (6, 3) Graphs. Computing 54(4): 303-316 (1995)
1994
2EELuitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer: Direct Path Graph Isomorphism (Extended Abstract). WG 1994: 395-406
1EELuitpold Babel, Gottfried Tinhofer: Hard-to-color Graphs for Connected Sequential Colorings. Discrete Applied Mathematics 51(1-2): 3-25 (1994)

Coauthor Index

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

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)