Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="M{\"u}ller, Haiko"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Colouring AT-free graphs
Dieter Kratsch
,
Haiko Müller
Lecture Notes in Computer Science
7501
, 2012, pp. 707-718
On the stable degree of graphs
Haiko Müller
Lecture Notes in Computer Science
7551
, 2012, pp. 148-159
On the stable degree of graphs
Haiko Müller
Lecture Notes in Computer Science
7551
, 2012, pp. 148-159
Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
Ton Kloks
,
Haiko Müller
,
Kristina Vus̑ković
Journal of Combinatorial Theory Series B
99
(5), 2009, pp. 733-800
On finding graph clusterings with maximum modularity
Ulrik Brandes
,
Daniel Delling
,
Marco Gaertler
,
Robert Görke
,
Martin Hoefer
,
Zoran Nikoloski
,
Dorothea Wagner
Lecture Notes in Computer Science
4769
, 2007, pp. 121-132
Recognizing bipartite tolerance graphs in linear time
Arthur H. Busch
,
Garth Isaak
Lecture Notes in Computer Science
4769
, 2007, pp. 12-20
Mixing 3-colourings in bipartite graphs
Luis Cereceda
,
Jan van den Heuvel
,
Matthew Johnson
Lecture Notes in Computer Science
4769
, 2007, pp. 166-177
The 3-Steiner root problem
Maw-Shang Chang
,
Ming-Tat Ko
Lecture Notes in Computer Science
4769
, 2007, pp. 109-120
Graph operations characterizing rank-width and balanced graph expressions
Bruno Courcelle
,
Mamadou Moustapha Kanté
Lecture Notes in Computer Science
4769
, 2007, pp. 66-75
Segmenting strings homogeneously via trees
Peter Damaschke
Lecture Notes in Computer Science
4769
, 2007, pp. 214-225
How to use planarity efficiently: New tree-decomposition based algorithms
Frederic Dorn
Lecture Notes in Computer Science
4769
, 2007, pp. 280-291
Complexity and approximation results for the connected vertex cover problem
Bruno Escoffier
,
Laurent Gourvès
,
Jérôme Monnot
Lecture Notes in Computer Science
4769
, 2007, pp. 202-213
On the number of
\alpha
-orientations
Stefan Felsner
,
Florian Zickfeld
Lecture Notes in Computer Science
4769
, 2007, pp. 190-201
Mixed search number and linear-width of interval and split graphs
Fedor V. Fomin
,
Pinar Heggernes
,
Rodica Mihai
Lecture Notes in Computer Science
4769
, 2007, pp. 304-315
On minimum area planar upward drawings of directed trees and other families of directed acyclic graphs
Fabrizio Frati
Lecture Notes in Computer Science
4769
, 2007, pp. 133-144
On restrictions of balanced 2-interval graphs
Philippe Gambette
,
Stéphane Vialette
Lecture Notes in Computer Science
4769
, 2007, pp. 55-65
Computational complexity of generalized domination: A complete dichotomy for chordal graphs
Petr Golovach
,
Jan Kratochvíl
Lecture Notes in Computer Science
4769
, 2007, pp. 1-11
The clique-width of tree-power and leaf-power graphs
Frank Gurski
,
Egon Wanke
Lecture Notes in Computer Science
4769
, 2007, pp. 76-85
Lower bounds for three algorithms for the transversal hypergraph generation
Matthias Hagen
Lecture Notes in Computer Science
4769
, 2007, pp. 316-327
A very practical algorithm for the two-paths problem in 3-connected planar graphs
Torben Hagerup
Lecture Notes in Computer Science
4769
, 2007, pp. 145-150
The complexity of bottleneck labeled graph problems
Refael Hassin
,
Jérôme Monnot
,
Danny Segev
Lecture Notes in Computer Science
4769
, 2007, pp. 328-340
Approximation algorithms for geometric intersection graphs
Klaus Jansen
Lecture Notes in Computer Science
4769
, 2007, pp. 151-153
Characterisations and linear-time recognition of probe cographs
Van Bang Le
,
H.N. de Ridder
Lecture Notes in Computer Science
4769
, 2007, pp. 226-237
NLC-2 graph recognition and isomorphism
Vincent Limouzy
,
Fabien de Montgolfier
,
Michaël Rao
Lecture Notes in Computer Science
4769
, 2007, pp. 86-98
Proper Helly circular-arc graphs
Min Chi Lin
,
Francisco J. Soulignac
,
Jayme L. Szwarcfiter
Lecture Notes in Computer Science
4769
, 2007, pp. 248-257
Seiten 1
2
3
>