Dimitrios M. Thilikos
Computational Theory and Mathematics · 2005–2009
A researcher in the Science corpus: 4 papers; trusts 2 researchers and is trusted by 12 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 10 citations into it; #1,895 of 12,182 by trust here, #5,465 by citations
Whom Dimitrios M. Thilikos trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Dimitrios M. Thilikos overall
- Dexter Campbell Kozen
- Hans L. Bodlaender
- Sebastian Ordyniak
- Jiong Guo
- Stefan Szeider
- Rolf Niedermeier
- Marek Cygan
- Stefan Kratsch
- Jesper Nederlof
- Xianshun Chen
Papers from Dimitrios M. Thilikos's perspective
Ordered by how strongly the researchers Dimitrios M. Thilikos trusts endorse each paper. Same corpus, a different order for every researcher.
- Invitation to fixed-parameter algorithms (Computer Science Review)
- Parameterized Complexity Theory
- Graphs on Surfaces (Johns Hopkins series in the mathematical sciences)
- Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
- Invitation to data reduction and problem kernelization (SIGA)
- On problems without polynomial kernels (Journal of computer and system sciences (Print))
- Directed Tree-Width (J. Comb. Theory B)
- Γ and B
- The theory of search games and rendezvous (International Series in Operations Research and Management Science)
- SEARCHING AND SWEEPING GRAPHS: A BRIEF SURVEY
Their papers
- Invitation to fixed-parameter algorithms (2007) — 1,042 citations
- Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs (2005) — 337 citations
- (Meta) Kernelization (2009) — 323 citations
- An annotated bibliography on guaranteed graph searching (2008) — 331 citations