Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Ata de Congresso
|
(Meta) KernelizationBodlaender, H.L. ; Fomin, F.V. ; Lokshtanov, D. ; Penninkx, E. ; Saurabh, S. ; Thilikos, D.M.2009 50th Annual IEEE Symposium on Foundations of Computer Science, 2009, p.629-638IEEETexto completo disponível |
|
2 |
Material Type: Artigo
|
Monotonicity and inert fugitive search gamesStamatiou, Y.C. ; Thilikos, D.M.Electronic notes in discrete mathematics, 1999-05, Vol.3, p.184-184Elsevier B.VTexto completo disponível |
|
3 |
Material Type: Artigo
|
On interval routing schemes and treewidthBodlaender, H.L ; van Leeuwen, J ; Tan, R ; Thilikos, D.M1997Texto completo disponível |
|
4 |
Material Type: Report
|
Algorithms and obstructions for linear-width and related search parametersThilikos, D.M1997Texto completo disponível |
|
5 |
Material Type: Artigo
|
Graphs with branchwidth at most threeBodlaender, H.L ; Thilikos, D.M1997Texto completo disponível |
|
6 |
Material Type: Report
|
Constructive linear time algorithms for branchwidthBodlaender, H.L ; Thilikos, D.M2000Texto completo disponível |
|
7 |
Material Type: Report
|
Computing small search numbers in linear timeBodlaender, H.L ; Thilikos, D.M1998Texto completo disponível |
|
8 |
Material Type: Artigo
|
A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidthThilikos, D.M ; Serna, M.J ; Bodlaender, H.L2001-02Texto completo disponível |
|
9 |
Material Type: Report
|
Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problemsThilikos, D.M ; Bodlaender, H.L1996Texto completo disponível |
|
10 |
Material Type: Report
|
Treewidth and small separators for graphs with small chordalityBodlaender, H.L ; Thilikos, D.M1995Texto completo disponível |