Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Ata de Congresso
|
Kernelization: New Upper and Lower Bound TechniquesBodlaender, Hans L.Parameterized and Exact Computation, p.17-37 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergSem texto completo |
|
2 |
Material Type: Ata de Congresso
|
Treewidth: Characterizations, Applications, and ComputationsBodlaender, Hans L.Graph-Theoretic Concepts in Computer Science, 2006, p.1-14 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergSem texto completo |
|
3 |
Material Type: Ata de Congresso
|
The Clever Shopper ProblemBulteau, Laurent ; Hermelin, Danny ; Labarre, Anthony ; Vialette, StéphaneComputer Science – Theory and Applications, 2018, p.53-64 [Periódico revisado por pares]Cham: Springer International PublishingSem texto completo |
|
4 |
Material Type: Ata de Congresso
|
Slopes of 3-Dimensional Subshifts of Finite TypeMoutot, Etienne ; Vanier, PascalComputer Science – Theory and Applications, 2018, p.257-268 [Periódico revisado por pares]Cham: Springer International PublishingSem texto completo |
|
5 |
Material Type: Ata de Congresso
|
Maximum Colorful Cycles in Vertex-Colored GraphsItaliano, Giuseppe F. ; Manoussakis, Yannis ; Kim Thang, Nguyen ; Pham, Hong PhongCSR 2018: Computer Science – Theory and Applications, 2018, Vol.10846, p.106-117 [Periódico revisado por pares]Cham: Springer International PublishingSem texto completo |
|
6 |
Material Type: Ata de Congresso
|
Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session TypesDeniélou, Pierre-Malo ; Yoshida, NobukoAutomata, Languages, and Programming, p.174-186 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
7 |
Material Type: Capítulo de Livro
|
On Strong NP-Completeness of Rational ProblemsWojtczak, DominikComputer Science – Theory and Applications, 2018, p.308-320 [Periódico revisado por pares]Cham: Springer International PublishingSem texto completo |
|
8 |
Material Type: Capítulo de Livro
|
Can We Create Large k-Cores by Adding Few Edges?Chitnis, Rajesh ; Talmon, NimrodComputer Science – Theory and Applications, 2018, p.78-89 [Periódico revisado por pares]Cham: Springer International PublishingSem texto completo |
|
9 |
Material Type: Capítulo de Livro
|
Distributed Symmetry-Breaking Algorithms for Congested CliquesBarenboim, Leonid ; Khazanov, VictorComputer Science – Theory and Applications, 2018, p.41-52 [Periódico revisado por pares]Cham: Springer International PublishingSem texto completo |
|
10 |
Material Type: Artigo
|
Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphsDemaine, Erik ; Fomin, Fedor ; Hajiaghayi, Mohammadtaghi ; Thilikos, DimitriosJournal of the ACM, 2005-11, Vol.52 (6), p.866-893 [Periódico revisado por pares]New York, NY: ACMTexto completo disponível |