Veröffentlichungen

• ''Clique-Width for four-vertex forbidden subgraphs '',
  Theory of Computing Systems, angenommen.
  Coautoren: Andreas Brandstädt, Joost Engelfriet, Vadim V. Lozin
  
  
• ''Chordal Co-gem-Free and (P₅, gem)-Free Graphs Have Bounded Clique-Width'',
  Discrete Applied Mathematics, 145 (2005) 232-241.
  Coautoren: Andreas Brandstädt, Raffaele Mosca
  
  
• "Contributions to Clique-Width of Graphs",
  Cuvillier Verlag Göttingen, 2004. ISBN 3-86537-013-6
  
  
• ''Tree Spanners in Chordal Graphs: Complexity, Algorithms, and Open Problems'',
  Theoretical Computer Science, 310 (2004) 329-354.
  Coautoren: Andreas Brandstädt, Van Bang Le, Feodor F. Dragan
  
  
• ''(Gem, co-gem)-Free Graphs Have Bounded Clique-Width'',
  International Journal of Foundations of Computer Science 15 (2004) 163-185
  Coautoren: Andreas Brandstädt, Raffaele Mosca (Pescara, Italien)
  
  
• ''Structure and Stability Number of Chair, co-P, and Gem-free Graphs Revisited'',
  Information Processing Letters 86 (2003) 161-167.
  Coautoren: Andreas Brandstädt, Jean-Marie Vanherpe
  
  
• ''Splitting a Graph Into Disjoint Induced Paths or Cycles'',
  Discrete Applied Mathematics, 131 (2003) 199-212.
  Coautoren: Van Bang Le, Haiko Müller
  
  
• ''Additive Tree Spanners'',
  SIAM Journal Discrete Mathematics, 17 (2003) 332-340.
  Coautoren: Dieter Kratsch, Haiko Müller, Erich Prisner, Dorothea Wagner
  
  
• ''On α-Redundant Vertices in P₅-Free Graphs'',
  Information Processing Letters 82 (2002) 119-122.
  Coautoren: Andreas Brandstädt, Van Bang Le
  
  
• ''The NP-Completeness of (1,r)-Subcolorability of Cubic Graphs'',
  Information Processing Letters 81 (2002) 157-162.
  Coautor: Van Bang Le
  
  
• ''Optimal Tree 3-Spanners in Directed Path Graphs'',
  Networks 34 (1999), 81-87.
  Coautor: Van Bang Le
  
  
• ''New Graph Classes of Bounded Clique-Width'',
  Theory of Computing Systems, angenommen.
  Coautoren: Andreas Brandstädt, Feodor F. Dragan, Raffaele Mosca
  
  

Tagungsbeiträge

• ''Tree Spanners in Chordal Bipartite Graphs and Probe Interval Graphs'',
  29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2003), Elspeet, The Netherlands.
  Extended Abstract in: Lecture Notes in Computer Science 2880 (2003), 106-118.
  Coautoren: Andreas Brandstädt, Van Bang Le, Feodor F. Dragan, Ruyhei Ueraha
  
  
• ''New Graph Classes of Bounded Clique-Width'',
  28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2002), Cesky Krumlov, Czech Republic.
  Extended Abstract in: Lecture Notes in Computer Science 2573 (2002), 57-67.
  Coautoren: Andreas Brandstädt, Feodor F. Dragan, Raffaele Mosca
  
  
• ''Tree Spanners in Chordal Graphs: Complexity, Algorithms, and Open Problems'',
  13th Annual International Symposium on Algorithms and Computation (ISAAC 2002), Vancouver, Canada.
  Extended Abstract in: Lecture Notes in Computer Science 2518 (2002), 163-174
  Coautoren: Andreas Brandstädt, Van Bang Le, Feodor F. Dragan
  
  

Eingereichte Arbeiten

• ''Tree Spanners in Chordal Bipartite Graphs and Probe Interval Graphs'',
  Algorithmica, eingereicht.
  Coautoren: Andreas Brandstädt, Van Bang Le, Feodor F. Dragan, Ruyhei Ueraha
  
  

Weitere Arbeiten

• ''Effiziente Algorithmen für Baumspanner in chordalen Graphen'',
  Diplomarbeit, Fachbereich Mathematik, Technische Universität Berlin, 1999
  
  
• ''Contributions to Clique-Width of Graphs'',
  Dissertation, Fachbereich Mathematik, Universität Rostock, 2003

---

© Hoàng-Oanh Lê, 24.04.2005