The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Luitpold Babel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  21. A fast algorithm for the maximum weight clique problem. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002