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="Broersma, Hajo"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A PTAS for the minimum weight connected vertex cover
P_3
problem on unit disk graphs
Limin Wang
,
Xiaoyan Zhang
,
Zhao Zhang
,
Hajo Broersma
Theoretical Computer Science
571
, 2015, pp. 58-66
On toughness and Hamiltonicity of
2K_2
-free graphs
Hajo Broersma
,
Viresh Patel
,
Artem Pyatkin
Journal of Graph Theory
75
(3), 2014, pp. 244-255
Removable edges and chords of longest cycles in 3-connected graphs
Jichang Wu
,
Hajo Broersma
,
Haiyan Kang
Graphs and Combinatorics
30
(3), 2014, pp. 743-753
Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
Hajo Broersma
,
Jiȓí Fiala
,
Petr A. Golovach
,
Tomás̑ Kaiser
,
Daniël Paulusma
,
Andrej Proskurowski
Lecture Notes in Computer Science
8165
, 2013, pp. 127-138
Exact algorithms for finding longest cycles in claw-free graphs
Hajo Broersma
,
Fedor V. Fomin
,
Pim van 't Hof
,
Daniël Paulusma
Algorithmica
65
(1), 2013, pp. 129-145
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
Hajo Broersma
,
Petr A. Golovach
,
Viresh Patel
Theoretical Computer Science
485
, 2013, pp. 69-84
Updating the complexity status of coloring graphs without a fixed induced linear forest
Hajo Broersma
,
Petr A. Golovach
,
Daniël Paulusma
,
Jian Song
Theoretical Computer Science
414
(1), 2012, pp. 9-19
Determining the chromatic number of triangle-free
2P_3
-free graphs in polynomial time
Hajo Broersma
,
Petr A. Golovach
,
Daniël Paulusma
,
Jian Song
Theoretical Computer Science
423
, 2012, pp. 1-10
Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
MingChu Li
,
Xiaodong Chen
,
Hajo Broersma
Journal of Graph Theory
68
(4), 2011, pp. 285-298
Fast exact algorithms for Hamiltonicity in claw-free graphs
Hajo Broersma
,
Fedor V. Fomin
,
Pim van 't Hof
,
Daniël Paulusma
Lecture Notes in Computer Science
5911
, 2010, pp. 44-53
Narrowing down the gap on the complexity of coloring
P_k
-free graphs
Hajo Broersma
,
Petr A. Golovach
,
Daniël Paulusma
,
Jian Song
Lecture Notes in Computer Science
6410
, 2010, pp. 63-74
On coloring graphs without induced forests
Hajo Broersma
,
Petr A. Golovach
,
Daniël Paulusma
,
Jian Song
Lecture Notes in Computer Science
6507
, 2010, pp. 156-167
Upper bounds and algorithms for parallel knock-out numbers
Hajo Broersma
,
Matthew Johnson
,
Daniël Paulusma
Theoretical Computer Science
410
(14), 2009, pp. 1319-1327
Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
Hajo Broersma
,
Daniël Paulusma
,
Kiyoshi Yoshimoto
Graphs and Combinatorics
25
(4), 2009, pp. 427-460
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
A new algorithm for on-line coloring bipartite graphs
Hajo J. Broersma
,
Agostino Capponi
,
Daniël Paulusma
SIAM Journal on Discrete Mathematics
22
(1), 2008, pp. 72-91
The computational complexity of the parallel knock-out problem
Hajo Broersma
,
Matthew Johnson
,
Daniël Paulusma
,
Iain A. Stewart
Theoretical Computer Science
393
(1-3), 2008, pp. 182-195
Computing sharp 2-factors in claw-free graphs
Hajo Broersma
,
Daniël Paulusma
Lecture Notes in Computer Science
5162
, 2008, pp. 193-204
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
Seiten 1
2
3
>