| 2009 |
|---|
| 91 | EE | Fedor V. Fomin,
Petr A. Golovach,
Dimitrios M. Thilikos:
Approximating Acyclicity Parameters of Sparse Hypergraphs.
STACS 2009: 445-456 |
| 90 | EE | Hans L. Bodlaender,
Fedor V. Fomin,
Daniel Lokshtanov,
Eelko Penninkx,
Saket Saurabh,
Dimitrios M. Thilikos:
(Meta) Kernelization
CoRR abs/0904.0727: (2009) |
| 89 | EE | Hans L. Bodlaender,
Michael R. Fellows,
Dimitrios M. Thilikos:
Derivation of algorithms for cutwidth and related graph layout parameters.
J. Comput. Syst. Sci. 75(4): 231-244 (2009) |
| 2008 |
|---|
| 88 | | Fedor V. Fomin,
Saket Saurabh,
Dimitrios M. Thilikos:
Improving the gap of Erdös-Pósa property for minor-closed graph classes.
CTW 2008: 2-6 |
| 87 | EE | Frederic Dorn,
Fedor V. Fomin,
Dimitrios M. Thilikos:
Catalan structures and dynamic programming in H-minor-free graphs.
SODA 2008: 631-640 |
| 86 | EE | Athanassios Koutsonas,
Dimitrios M. Thilikos:
Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms.
WG 2008: 264-274 |
| 85 | EE | David Richerby,
Dimitrios M. Thilikos:
Searching for a Visible, Lazy Fugitive.
WG 2008: 348-359 |
| 84 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
Branchwidth of Graphs.
Encyclopedia of Algorithms 2008 |
| 83 | EE | Michael R. Fellows,
Christian Knauer,
Naomi Nishimura,
Prabhakar Ragde,
Frances A. Rosamond,
Ulrike Stege,
Dimitrios M. Thilikos,
Sue Whitesides:
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
Algorithmica 52(2): 167-176 (2008) |
| 82 | EE | Fedor V. Fomin,
Petr A. Golovach,
Dimitrios M. Thilikos:
Approximating acyclicity parameters of sparse hypergraphs
CoRR abs/0809.3646: (2008) |
| 81 | EE | Frederic Dorn,
Fedor V. Fomin,
Dimitrios M. Thilikos:
Subexponential parameterized algorithms.
Computer Science Review 2(1): 29-39 (2008) |
| 80 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
Efficient algorithms for counting parameterized list H-colorings.
J. Comput. Syst. Sci. 74(5): 919-937 (2008) |
| 79 | EE | Fedor V. Fomin,
Pierre Fraigniaud,
Dimitrios M. Thilikos:
Forewords: Special issue on graph searching.
Theor. Comput. Sci. 399(3): 157 (2008) |
| 78 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
An annotated bibliography on guaranteed graph searching.
Theor. Comput. Sci. 399(3): 236-245 (2008) |
| 2007 |
|---|
| 77 | EE | Frederic Dorn,
Fedor V. Fomin,
Dimitrios M. Thilikos:
Subexponential Parameterized Algorithms.
ICALP 2007: 15-27 |
| 76 | EE | David Richerby,
Dimitrios M. Thilikos:
Graph Searching in a Crime Wave.
WG 2007: 21-32 |
| 75 | EE | Dimitrios M. Thilikos:
Invitation to fixed-parameter algorithms.
Computer Science Review 1(2): 103-104 (2007) |
| 74 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
Complexity issues on bounded restrictive H-coloring.
Discrete Mathematics 307(16): 2082-2093 (2007) |
| 73 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
On self duality of pathwidth in polyhedral graph embeddings.
Journal of Graph Theory 55(1): 42-54 (2007) |
| 2006 |
|---|
| 72 | | Hannes Moser,
Dimitrios M. Thilikos:
Parameterized Complexity of Finding Regular Induced Subgraphs.
ACiD 2006: 107-118 |
| 71 | EE | Hans L. Bodlaender,
Fedor V. Fomin,
Arie M. C. A. Koster,
Dieter Kratsch,
Dimitrios M. Thilikos:
On Exact Algorithms for Treewidth.
ESA 2006: 672-683 |
| 70 | EE | Josep Díaz,
Dimitrios M. Thilikos:
Fast FPT-Algorithms for Cleaning Grids.
STACS 2006: 361-371 |
| 69 | EE | Frederic Dorn,
Fedor V. Fomin,
Dimitrios M. Thilikos:
Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus.
SWAT 2006: 172-183 |
| 68 | EE | Josep Díaz,
Jordi Petit,
Dimitrios M. Thilikos:
Kernels for the Vertex Cover Problem on the Preferred Attachment Model.
WEA 2006: 231-240 |
| 67 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
A 3-approximation for the pathwidth of Halin graphs.
J. Discrete Algorithms 4(4): 499-510 (2006) |
| 66 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
New upper bounds on the decomposability of planar graphs.
Journal of Graph Theory 51(1): 53-81 (2006) |
| 65 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up.
SIAM J. Comput. 36(2): 281-309 (2006) |
| 64 | EE | Erik D. Demaine,
MohammadTaghi Hajiaghayi,
Dimitrios M. Thilikos:
The Bidimensional Theory of Bounded-Genus Graphs.
SIAM J. Discrete Math. 20(2): 357-371 (2006) |
| 2005 |
|---|
| 63 | EE | Naomi Nishimura,
Prabhakar Ragde,
Dimitrios M. Thilikos:
Parameterized Counting Algorithms for General Graph Covering Problems.
WADS 2005: 99-109 |
| 62 | EE | Erik D. Demaine,
Fedor V. Fomin,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs.
ACM Transactions on Algorithms 1(1): 33-47 (2005) |
| 61 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors.
Algorithmica 41(4): 245-267 (2005) |
| 60 | | Maria J. Serna,
Dimitrios M. Thilikos:
Parameterized Complexity for Graph Layout Problems.
Bulletin of the EATCS 86: 41-65 (2005) |
| 59 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
The restrictive H-coloring problem.
Discrete Applied Mathematics 145(2): 297-305 (2005) |
| 58 | EE | Naomi Nishimura,
Prabhakar Ragde,
Dimitrios M. Thilikos:
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover.
Discrete Applied Mathematics 152(1-3): 229-245 (2005) |
| 57 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos,
Ioan Todinca:
Connected Graph Searching in Outerplanar Graphs.
Electronic Notes in Discrete Mathematics 22: 213-216 (2005) |
| 56 | EE | Erik D. Demaine,
Fedor V. Fomin,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs.
J. ACM 52(6): 866-893 (2005) |
| 55 | EE | Dimitrios M. Thilikos,
Maria J. Serna,
Hans L. Bodlaender:
Cutwidth I: A linear time fixed parameter algorithm.
J. Algorithms 56(1): 1-24 (2005) |
| 54 | EE | Dimitrios M. Thilikos,
Maria J. Serna,
Hans L. Bodlaender:
Cutwidth II: Algorithms for partial w-trees of bounded degree.
J. Algorithms 56(1): 25-49 (2005) |
| 2004 |
|---|
| 53 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings.
ESA 2004: 275-286 |
| 52 | EE | Michael R. Fellows,
Christian Knauer,
Naomi Nishimura,
Prabhakar Ragde,
Frances A. Rosamond,
Ulrike Stege,
Dimitrios M. Thilikos,
Sue Whitesides:
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
ESA 2004: 311-322 |
| 51 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up.
ICALP 2004: 581-592 |
| 50 | EE | Naomi Nishimura,
Prabhakar Ragde,
Dimitrios M. Thilikos:
Smaller Kernels for Hitting Set Problems of Constant Arity.
IWPEC 2004: 121-126 |
| 49 | EE | Hans L. Bodlaender,
Dimitrios M. Thilikos:
Computing Small Search Numbers in Linear Time.
IWPEC 2004: 37-48 |
| 48 | EE | Erik D. Demaine,
Fedor V. Fomin,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Bidimensional Parameters and Local Treewidth.
LATIN 2004: 109-118 |
| 47 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
The Bidimensional Theory of Bounded-Genus Graphs.
MFCS 2004: 191-203 |
| 46 | EE | Erik D. Demaine,
Fedor V. Fomin,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs.
SODA 2004: 830-839 |
| 45 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
A Simple and Fast Approach for Solving Problems on Planar Graphs.
STACS 2004: 56-67 |
| 44 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
A 3-approximation for the pathwidth of Halin graphs.
Electronic Notes in Discrete Mathematics 17: 157-162 (2004) |
| 43 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi,
Naomi Nishimura,
Prabhakar Ragde,
Dimitrios M. Thilikos:
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors.
J. Comput. Syst. Sci. 69(2): 166-195 (2004) |
| 42 | EE | Erik D. Demaine,
Fedor V. Fomin,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Bidimensional Parameters and Local Treewidth.
SIAM J. Discrete Math. 18(3): 501-511 (2004) |
| 2003 |
|---|
| 41 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
Dominating Sets and Local Treewidth.
ESA 2003: 221-229 |
| 40 | EE | Erik D. Demaine,
Fedor V. Fomin,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs.
ICALP 2003: 829-844 |
| 39 | EE | Hans L. Bodlaender,
Michael R. Fellows,
Dimitrios M. Thilikos:
Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms.
MFCS 2003: 239-248 |
| 38 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
Dominating sets in planar graphs: branch-width and exponential speed-up.
SODA 2003: 168-177 |
| 37 | EE | Lali Barrière,
Pierre Fraigniaud,
Nicola Santoro,
Dimitrios M. Thilikos:
Searching Is Not Jumping.
WG 2003: 34-45 |
| 36 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
On the monotonicity of games generated by symmetric submodular functions.
Discrete Applied Mathematics 131(2): 323-335 (2003) |
| 2002 |
|---|
| 35 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor.
APPROX 2002: 67-80 |
| 34 | EE | Josep Díaz,
Jaroslav Nesetril,
Maria J. Serna,
Dimitrios M. Thilikos:
H-Colorings of Large Degree Graphs.
EurAsia-ICT 2002: 850-857 |
| 33 | EE | Erik D. Demaine,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs.
ISAAC 2002: 262-273 |
| 32 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
The Complexity of Restrictive H-Coloring.
WG 2002: 126-137 |
| 31 | EE | Naomi Nishimura,
Prabhakar Ragde,
Dimitrios M. Thilikos:
On Graph Powers for Leaf-Labeled Trees.
J. Algorithms 42(1): 69-108 (2002) |
| 30 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
Counting H-colorings of partial k-trees.
Theor. Comput. Sci. 281(1-2): 291-309 (2002) |
| 2001 |
|---|
| 29 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
Counting H-Colorings of Partial k-Trees.
COCOON 2001: 298-307 |
| 28 | EE | Dimitrios M. Thilikos,
Maria J. Serna,
Hans L. Bodlaender:
A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth.
ESA 2001: 380-390 |
| 27 | EE | Josep Díaz,
Maria J. Serna,
Dimitrios M. Thilikos:
(H, C, K)-Coloring: Fast, Easy, and Hard Cases.
MFCS 2001: 304-315 |
| 26 | EE | Josep Díaz,
Dimitrios Koukopoulos,
Sotiris E. Nikoletseas,
Maria J. Serna,
Paul G. Spirakis,
Dimitrios M. Thilikos:
Stability and non-stability of the FIFO protocol.
SPAA 2001: 48-52 |
| 25 | EE | Naomi Nishimura,
Prabhakar Ragde,
Dimitrios M. Thilikos:
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover.
WADS 2001: 75-86 |
| 24 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
On the Monotonicity of Games Generated by Symmetric Submodular Functions.
WG 2001: 177-188 |
| 23 | EE | Mohammad Taghi Hajiaghayi,
Naomi Nishimura,
Prabhakar Ragde,
Dimitrios M. Thilikos:
Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs.
Electronic Notes in Discrete Mathematics 10: 137-142 (2001) |
| 2000 |
|---|
| 22 | EE | Dimitrios M. Thilikos,
Maria J. Serna,
Hans L. Bodlaender:
Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width.
ISAAC 2000: 192-203 |
| 21 | EE | Naomi Nishimura,
Prabhakar Ragde,
Dimitrios M. Thilikos:
On Graph Powers for Leaf-Labeled Trees.
SWAT 2000: 125-138 |
| 20 | | Nick D. Dendris,
Lefteris M. Kirousis,
Yannis C. Stamatiou,
Dimitrios M. Thilikos:
On Parallel Partial Solutions and Approximation Schemes for Local Consistency in Networks of Constraints.
Constraints 5(3): 251-273 (2000) |
| 19 | | Dimitrios M. Thilikos:
Algorithms and obstructions for linear-width and related search parameters.
Discrete Applied Mathematics 105(1-3): 239-271 (2000) |
| 18 | | Naomi Nishimura,
Prabhakar Ragde,
Dimitrios M. Thilikos:
Finding Smallest Supertrees Under Minor Containment.
Int. J. Found. Comput. Sci. 11(3): 445-465 (2000) |
| 1999 |
|---|
| 17 | EE | Naomi Nishimura,
Prabhakar Ragde,
Dimitrios M. Thilikos:
Finding Smallest Supertrees Under Minor Containment.
WG 1999: 303-312 |
| 16 | EE | Koichi Yamazaki,
Hans L. Bodlaender,
Babette de Fluiter,
Dimitrios M. Thilikos:
Isomorphism for Graphs of Bounded Distance Width.
Algorithmica 24(2): 105-127 (1999) |
| 15 | EE | Yannis C. Stamatiou,
Dimitrios M. Thilikos:
Monotonicity and inert fugitive search games.
Electronic Notes in Discrete Mathematics 3: 184 (1999) |
| 14 | EE | Dimitrios M. Thilikos:
Quickly Excluding K2, r from Planar Graphs.
Electronic Notes in Discrete Mathematics 3: 189-194 (1999) |
| 13 | | Hans L. Bodlaender,
Dimitrios M. Thilikos:
Graphs with Branchwidth at Most Three.
J. Algorithms 32(2): 167-194 (1999) |
| 1997 |
|---|
| 12 | | Koichi Yamazaki,
Hans L. Bodlaender,
Babette de Fluiter,
Dimitrios M. Thilikos:
Isomorphism for Graphs of Bounded Distance Width.
CIAC 1997: 276-287 |
| 11 | | Hans L. Bodlaender,
Dimitrios M. Thilikos:
Constructive Linear Time Algorithms for Branchwidth.
ICALP 1997: 627-637 |
| 10 | EE | Hans L. Bodlaender,
Dimitrios M. Thilikos:
Treewidth for Graphs with Small Chordality.
Discrete Applied Mathematics 79(1-3): 45-61 (1997) |
| 9 | | Hans L. Bodlaender,
Jan van Leeuwen,
Richard B. Tan,
Dimitrios M. Thilikos:
On Interval Routing Schemes and Treewidth.
Inf. Comput. 139(1): 92-109 (1997) |
| 8 | EE | Hans L. Bodlaender,
Dimitrios M. Thilikos,
Koichi Yamazaki:
It is Hard to Know when Greedy is Good for Finding Independent Sets.
Inf. Process. Lett. 61(2): 101-111 (1997) |
| 7 | EE | Dimitrios M. Thilikos,
Hans L. Bodlaender:
Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems.
Inf. Process. Lett. 61(5): 227-232 (1997) |
| 6 | EE | Nick D. Dendris,
Lefteris M. Kirousis,
Dimitrios M. Thilikos:
Fugitive-Search Games on Graphs and Related Parameters.
Theor. Comput. Sci. 172(1-2): 233-254 (1997) |
| 1996 |
|---|
| 5 | | Lefteris M. Kirousis,
Dimitrios M. Thilikos:
The Linkage of a Graph.
SIAM J. Comput. 25(3): 626-647 (1996) |
| 1995 |
|---|
| 4 | | Nick D. Dendris,
Lefteris M. Kirousis,
Yannis C. Stamatiou,
Dimitrios M. Thilikos:
Partiality and Approximation Schemes for Local Consistency in Networks of Constraints.
FSTTCS 1995: 210-224 |
| 3 | | Nick Lendris,
Lefteris M. Kirousis,
Yannis C. Stamatiou,
Dimitrios M. Thilikos:
Partial Arc Consistency.
Over-Constrained Systems 1995: 229-236 |
| 2 | | Hans L. Bodlaender,
Richard B. Tan,
Dimitrios M. Thilikos,
Jan van Leeuwen:
On Interval Routing Schemes and Treewidth.
WG 1995: 181-196 |
| 1994 |
|---|
| 1 | | Nick D. Dendris,
Lefteris M. Kirousis,
Dimitrios M. Thilikos:
Fugitive-Search Games on Graphs and Related Parameters.
WG 1994: 331-342 |
