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
[2]
Hilfe
Suche: Author="Kloks, Ton"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On maximum independent set of categorical product and ultimate categorical ratios of graphs
Wing-Kai Hon
,
Ton Kloks
,
Ching-Hao Liu
,
Hsiang-Hsuan Liu
,
Sheung-Hung Poon
,
Yue-Li Wang
Theoretical Computer Science
588
, 2015, pp. 81-95
On the complexity of the black-and-white coloring problem on some classes of perfect graphs
Ton Kloks
,
Sheung-Hung Poon
,
Feng-Ren Tsai
,
Yue-Li Wang
Theoretical Computer Science
532
, 2014, pp. 51-63
On retracts, absolute retracts, and folds in cographs
Ton Kloks
,
Yue-Li Wang
Lecture Notes in Computer Science
8165
, 2013, pp. 321-332
New parameterized algorithms for the edge dominating set problem
Mingyu Xiao
,
Ton Kloks
,
Sheung-Hung Poon
Theoretical Computer Science
511
, 2013, pp. 147-158
Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar graphs
Ton Kloks
,
Sheung-Hung Poon
,
Chin-Ting Ung
,
Yue-Li Wang
Lecture Notes in Computer Science
7434
, 2012, pp. 157-168
Block-graph width
Maw-Shang Chang
,
Ling-Ju Hung
,
Ton Kloks
,
Sheng-Lung Peng
Theoretical Computer Science
412
(23), 2011, pp. 2496-2502
New parameterized algorithms for the edge dominating set problem
Mingyu Xiao
,
Ton Kloks
,
Sheung-Hung Poon
Lecture Notes in Computer Science
6907
, 2011, pp. 604-615
Classifying rankwidth
k
-DH-graphs
Ling-Ju Hung
,
Ton Kloks
Lecture Notes in Computer Science
6072
, 2010, pp. 195-203
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
Probe ptolemaic graphs
David B. Chandler
,
Maw-Shang Chang
,
Ton Kloks
,
Van Bang Le
,
Sheng-Lung Peng
Lecture Notes in Computer Science
5092
, 2008, pp. 468-477
Probe ptolemaic graphs
David B. Chandler
,
Maw-Shang Chang
,
Ton Kloks
,
Van Bang Le
,
Sheng-Lung Peng
Lecture Notes in Computer Science
5092
, 2008, pp. 468-477
Partitioned probe comparability graphs
David B. Chandler
,
Maw-Shang Chang
,
Ton Kloks
,
Jiping Liu
,
Sheng-Lung Peng
Theoretical Computer Science
396
(1-3), 2008, pp. 212-222
Partitioned probe comparability graphs
David B. Chandler
,
Maw-Shang Chang
,
Ton Kloks
,
Jiping Liu
,
Sheng-Lung Peng
Lecture Notes in Computer Science
4271
, 2006, pp. 179-190
On the recognition of probe graphs of some self-complementary classes of perfect graphs
Maw-Shang Chang
,
Ton Kloks
,
Dieter Kratsch
,
Jiping Liu
,
Sheng-Lung Peng
Lecture Notes in Computer Science
3595
, 2005, pp. 808-817
Kernels in planar digraphs
Gregory Gutin
,
Ton Kloks
,
Chuan Min Lee
,
Anders Yeo
Journal of Computer and System Sciences
71
(2), 2005, pp. 174-184
Roman domination over some graph classes
Mathieu Liedloff
,
Ton Kloks
,
Jiping Liu
,
Sheng-Lung Peng
Lecture Notes in Computer Science
3787
, 2005, pp. 103-114
On the recognition of general partition graphs
Ton Kloks
,
Chuan-Min Lee
,
Jiping Liu
,
Haiko Müller
Lecture Notes in Computer Science
2880
, 2003, pp. 273-283
New algorithms for
k
-face cover,
k
-feedback vertex set, and
k
-disjoint cycles on plane and planar graphs
Ton Kloks
,
C.M. Lee
,
Jiping Liu
Lecture Notes in Computer Science
2573
, 2002, pp. 282-295
Maximum clique transversals
Maw-Shang Chang
,
Ton Kloks
,
Chuan-Min Lee
Lecture Notes in Computer Science
2204
, 2001, pp. 32-43
Fixed-parameter complexity of
\lambda
-labelings
Jiȓí Fiala
,
Ton Kloks
,
Jan Kratochvíl
Discrete Applied Mathematics
113
(1), 2001, pp. 59-72
On the structure of graphs with bounded asteroidal number
Ton Kloks
,
Dieter Kratsch
,
Haiko Müller
Graphs and Combinatorics
17
(2), 2001, pp. 295-306
Bandwidth and topological bandwidth of graphs with few
P_4
's
Ton Kloks
,
Richard B. Tan
Discrete Applied Mathematics
115
(1-3), 2001, pp. 117-133
\lambda
-coloring of graphs
Hans L. Bodlaender
,
Ton Kloks
,
Richard B. Tan
,
Jan van Leeuwen
Lecture Notes in Computer Science
1770
, 2000, pp. 395-406
Degree-preserving trees
Hajo Broersma
,
Otto Koppius
,
Hilde Tuinstra
,
Andreas Huck
,
Ton Kloks
,
Dieter Kratsch
,
Haiko Müller
Networks
35
(1), 2000, pp. 26-39
Bandwidth of split and circular permutation graphs
Ton Kloks
,
Dieter Kratsch
,
Yvan Le Borgne
,
Haiko Müller
Lecture Notes in Computer Science
1928
, 2000, pp. 243-254
Seiten 1
2
3
>