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="Paulusma, Daniel"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Colouring of graphs with Ramsey-type forbidden subgraphs
Konrad K. Dabrowski
,
Petr A. Golovach
,
Daniel Paulusma
Theoretical Computer Science
522
, 2014, pp. 34-43
Editing to Eulerian graphs
Konrad K. Dabrowski
,
Petr A. Golovach
,
Pim van 't Hof
,
Daniel Paulusma
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 97-108
Satisfiability of acyclic and almost acyclic CNF formulas
Sebastian Ordyniak
,
Daniel Paulusma
,
Stefan Szeider
Theoretical Computer Science
481
, 2013, pp. 85-99
Model counting for CNF formulas of bounded modular treewidth
Daniel Paulusma
,
Friedrich Slivovsky
,
Stefan Szeider
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 55-66
Obtaining planarity by contracting few edges
Petr A. Golovach
,
Pim van 't Hof
,
Daniel Paulusma
Lecture Notes in Computer Science
7464
, 2012, pp. 455-466
Satisfiability of acyclic and almost acyclic CNF formulas
Sebastian Ordyniak
,
Daniel Paulusma
,
Stefan Szeider
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 84-95
A most general edge elimination polynomial
Ilia Averbouch
,
Benny Godlin
,
Johann A. Makowsky
Lecture Notes in Computer Science
5344
, 2008, pp. 31-42
Approximating the metric TSP in linear time
Davide Bilò
,
Luca Forlizzi
,
Guido Proietti
Lecture Notes in Computer Science
5344
, 2008, pp. 43-54
The valve location problem in simple network topologies
Hans L. Bodlaender
,
Alexander Grigoriev
,
Nadejda V. Grigorieva
,
Albert Hendriks
Lecture Notes in Computer Science
5344
, 2008, pp. 55-65
A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
Paul Bonsma
,
Florian Zickfeld
Lecture Notes in Computer Science
5344
, 2008, pp. 66-77
On the pseudo-achromatic number problem
Jianer Chen
,
Iyad A. Kanj
,
Jie Meng
,
Ge Xia
,
Fenghui Zhang
Lecture Notes in Computer Science
5344
, 2008, pp. 78-89
(Un)-stable routing in the Internet: A survey from the algorithmic perspective
Luca Cittadini
,
Giuseppe Di Battista
,
Massimo Rimondini
Lecture Notes in Computer Science
5344
, 2008, pp. 1-13
What is between chordal and weakly chordal graphs?
Elad Cohen
,
Martin Charles Golumbic
,
Marina Lipshteyn
,
Michal Stern
Lecture Notes in Computer Science
5344
, 2008, pp. 275-286
Making role assignment feasible: A polynomial-time algorithm for computing ecological colorings
Pilu Crescenzi
,
Miriam Di Ianni
,
Federico Greco
,
Gianluca Rossi
,
Paola Vocca
Lecture Notes in Computer Science
5344
, 2008, pp. 90-100
Faster exact bandwidth
Marek Cygan
,
Marcin Pilipczuk
Lecture Notes in Computer Science
5344
, 2008, pp. 101-109
Additive spanners for circle graphs and polygonal graphs
Feodor F. Dragan
,
Derek G. Corneil
,
Ekkehard Köhler
,
Yang Xiang
Lecture Notes in Computer Science
5344
, 2008, pp. 110-121
Upward straight-line embeddings of directed graphs into point sets
Alejandro Estrella-Balderrama
,
Fabrizio Frati
,
Stephen G. Kobourov
Lecture Notes in Computer Science
5344
, 2008, pp. 122-133
Complexity of the packing coloring problem for trees
Jiȓí Fiala
,
Petr A. Golovach
Lecture Notes in Computer Science
5344
, 2008, pp. 134-145
Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
J. Joseph Fowler
,
Michael Jünger
,
Stephen Kobourov
,
Michael Schulz
Lecture Notes in Computer Science
5344
, 2008, pp. 146-158
A lower bound on the area requirements of series-parallel graphs
Fabrizio Frati
Lecture Notes in Computer Science
5344
, 2008, pp. 159-170
Memory efficient anonymous graph exploration
Leszek Ga̧sieniec
,
Tomasz Radzik
Lecture Notes in Computer Science
5344
, 2008, pp. 14-29
On independent sets and bicliques in graphs
Serge Gaspers
,
Dieter Kratsch
,
Mathieu Liedloff
Lecture Notes in Computer Science
5344
, 2008, pp. 171-182
Evaluations of graph polynomials
Benny Godlin
,
Tomer Kotek
,
Johann A. Makowsky
Lecture Notes in Computer Science
5344
, 2008, pp. 183-194
Parameterized complexity for domination problems on degenerate graphs
Petr A. Golovach
,
Yngve Villanger
Lecture Notes in Computer Science
5344
, 2008, pp. 195-205
Algorithmic meta theorems
Martin Grohe
Lecture Notes in Computer Science
5344
, 2008, pp. 30-30
Seiten 1
2
>