Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
Diverse collections in matroids and graphsFomin, Fedor V. ; Golovach, Petr A. ; Panolan, Fahad ; Philip, Geevarghese ; Saurabh, SaketMathematical programming, 2024, Vol.204 (1-2), p.415-447 [Periódico revisado por pares]Berlin/Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
2 |
Material Type: Artigo
|
![]() |
A Note on Exact Algorithms for Vertex Ordering Problems on GraphsBodlaender, Hans L. ; Fomin, Fedor V. ; Koster, Arie M. C. A. ; Kratsch, Dieter ; Thilikos, Dimitrios M.Theory of computing systems, 2012-04, Vol.50 (3), p.420-432 [Periódico revisado por pares]New York: Springer-VerlagTexto completo disponível |
3 |
Material Type: Artigo
|
![]() |
Cops and Robber Game Without RechargingFomin, Fedor V. ; Golovach, Petr A. ; Lokshtanov, DanielTheory of computing systems, 2012-05, Vol.50 (4), p.611-620 [Periódico revisado por pares]New York: Springer-VerlagTexto completo disponível |
4 |
Material Type: Artigo
|
![]() |
New Plain-Exponential Time Classes for Graph HomomorphismWahlström, MagnusTheory of computing systems, 2011-08, Vol.49 (2), p.273-282 [Periódico revisado por pares]New York: Springer-VerlagTexto completo disponível |
5 |
Material Type: Artigo
|
![]() |
Colorings with few Colors: Counting, Enumeration and Combinatorial BoundsCouturier, Jean-Francois ; Golovach, Petr A. ; Kratsch, Dieter ; Liedloff, Mathieu ; Pyatkin, ArtemTheory of computing systems, 2013-05, Vol.52 (4), p.645-667 [Periódico revisado por pares]New York: Springer-VerlagTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
A combinatorial optimization algorithm for solving the branchwidth problemSmith, J. Cole ; Ulusal, Elif ; Hicks, Illya V.Computational optimization and applications, 2012-04, Vol.51 (3), p.1211-1229 [Periódico revisado por pares]Boston: Springer USTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
Conflict Free Version of Covering Problems on Graphs: Classical and ParameterizedJain, Pallavi ; Kanesh, Lawqueen ; Misra, PranabenduTheory of computing systems, 2020-08, Vol.64 (6), p.1067-1093 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
8 |
Material Type: Artigo
|
![]() |
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data StreamsBishnu, Arijit ; Ghosh, Arijit ; Kolay, Sudeshna ; Mishra, Gopinath ; Saurabh, SaketTheory of computing systems, 2023-12, Vol.67 (6), p.1241-1267 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
9 |
Material Type: Artigo
|
![]() |
Refined Parameterizations for Computing Colored Cuts in Edge-Colored GraphsMorawietz, Nils ; Grüttemeier, Niels ; Komusiewicz, Christian ; Sommer, FrankTheory of computing systems, 2022-10, Vol.66 (5), p.1019-1045 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
Trimmed Moebius Inversion and Graphs of Bounded DegreeBjörklund, Andreas ; Husfeldt, Thore ; Kaski, Petteri ; Koivisto, MikkoTheory of computing systems, 2010-10, Vol.47 (3), p.637-654 [Periódico revisado por pares]New York: Springer-VerlagTexto completo disponível |