Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Ata de Congresso
|
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential TimeCygan, M. ; Nederlof, J. ; Pilipczuk, M. ; Pilipczuk, M. ; van Rooij, Joham M. M. ; Wojtaszczyk, J. O.2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011, p.150-159IEEETexto completo disponível |
|
2 |
Material Type: Ata de Congresso
|
On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar GraphsMarx, Daniel ; Pilipczuk, Marcin ; Pilipczuk, Michal2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, p.474-484IEEETexto completo disponível |
|
3 |
Material Type: Artigo
|
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential TimeCygan, Marek ; Nederlof, Jesper ; Pilipczuk, Marcin ; Pilipczuk, Michał ; Van Rooij, Johan M. M. ; Wojtaszczyk, Jakub OnufryACM transactions on algorithms, 2022-04, Vol.18 (2), p.1-31 [Periódico revisado por pares]Texto completo disponível |
|
4 |
Material Type: Artigo
|
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph ClassesGiannopoulou, Archontia ; Pilipczuk, Michał ; Raymond, Jean-Florent ; Thilikos, Dimitrios M. ; Wrochna, MarcinSIAM journal on discrete mathematics, 2021-01, Vol.35 (1), p.105-151 [Periódico revisado por pares]Society for Industrial and Applied MathematicsSem texto completo |
|
5 |
Material Type: Artigo
|
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial SpaceNederlof, Jesper ; Pilipczuk, Michał ; Swennenhuis, Celine M. F. ; Węgrzycki, KarolSIAM journal on discrete mathematics, 2023-01, Vol.37 (3), p.1566-1586 [Periódico revisado por pares]Sem texto completo |
|
6 |
Material Type: Artigo
|
Cutwidth: Obstructions and Algorithmic AspectsGiannopoulou, Archontia C. ; Pilipczuk, Michał ; Raymond, Jean-Florent ; Thilikos, Dimitrios M. ; Wrochna, MarcinAlgorithmica, 2019-02, Vol.81 (2), p.557-588 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
7 |
Material Type: Artigo
|
Preprocessing subgraph and minor problems: When does a small vertex cover help?Fomin, Fedor V. ; Jansen, Bart M.P. ; Pilipczuk, MichałJournal of computer and system sciences, 2014-03, Vol.80 (2), p.468-495 [Periódico revisado por pares]Elsevier IncTexto completo disponível |
|
8 |
Material Type: Capítulo de Livro
|
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial SpaceNederlof, Jesper ; Pilipczuk, Michał ; Swennenhuis, Céline M. F. ; Węgrzycki, KarolGraph-Theoretic Concepts in Computer Science, 2020, p.27-39 [Periódico revisado por pares]Cham: Springer International PublishingSem texto completo |
|
9 |
Material Type: Capítulo de Livro
|
Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex SetDonkers, Huib ; Jansen, Bart M. P.Graph-Theoretic Concepts in Computer Science, 2021, p.1-14 [Periódico revisado por pares]Cham: Springer International PublishingSem texto completo |
|
10 |
Material Type: Capítulo de Livro
|
Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on GraphsFomin, Fedor V. ; Golovach, Petr A. ; Thilikos, Dimitrios M.Graph-Theoretic Concepts in Computer Science, 2021, Vol.12911, p.308-320 [Periódico revisado por pares]Cham: Springer International PublishingSem texto completo |