Výsledky vyhledávání - "Husfeldt, T."

The first parameterized algorithms and computational experiments challenge

Autor: Dell, H., Kaski, P., Jansen, B.M.P., Husfeldt, T., Guo, Jiong, Hermelin, Danny

Publikováno v: Proceedings of the 11th International Symposium on Parameterized and Exact Computation, IPEC 2016, 24-26 August 2016, Aarhus, Denmark, 1-9
STARTPAGE=1;ENDPAGE=9;TITLE=Proceedings of the 11th International Symposium on Parameterized and Exact Computation, IPEC 2016, 24-26 August 2016, Aarhus, Denmark

In this article, the steering committee of the Parameterized Algorithms and Computational Experiments challenge (PACE) reports on the first iteration of the challenge. Where did PACE come from, how did it go, who won, and what's next?

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c59f58c8bf26987b29903fdb52ef2631
https://doi.org/10.4230/lipics.ipec.2016.30

Zobrazit plný text záznamu

A Coalgebraic Foundation for Coinductive Union Types

Autor: Bonsangue, M., Rot, J.C., Ancona, D., Boer, F. de, Rutten, J., Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E.

Publikováno v: Lecture Notes in Computer Science ; 8573, 62-73. Berlin : Springer
STARTPAGE=62;ENDPAGE=73;TITLE=Lecture Notes in Computer Science ; 8573
Automata, Languages, and Programming ISBN: 9783662439500
ICALP (2)
Esparza, J.; Fraigniaud, P.; Husfeldt, T. (ed.), Automata, Languages, and Programming, pp. 62-73

This paper introduces a coalgebraic foundation for coinductive types, interpreted as sets of values and extended with set theoretic union. We give a sound and complete characterization of semantic subtyping in terms of inclusion of maximal traces. Fu

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5de3ffed4bb63b50402c89165313d24b
http://hdl.handle.net/2066/132704

Zobrazit plný text záznamu

Sparsification upper and lower bounds for graphs problems and not-all-equal SAT

Autor: Jansen, Bart M.P., Pieterse, Astrid, Husfeldt, T., Kanj, I.

Publikováno v: STARTPAGE=163;ENDPAGE=174;TITLE=10th International Symposium on Parameterized and Exact Computation, IPEC'15, September 16-18, 2015, Patras, Greece

We present several sparsification lower and upper bounds for classic problems in graph theory and logic. For the problems 4-Coloring, (Directed) Hamiltonian Cycle, and (Connected) Dominating Set, we prove that there is no polynomial-time algorithm th

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::029cb9848ff4a8d420a0d9ec3c676665
https://research.tue.nl/nl/publications/74983e15-f8cc-401d-b10c-56033bf995a5

Zobrazit plný text záznamu

Star Partitions of Perfect Graphs

Autor: Bevern, van, R., Bredereck, R., Bulteau, L., Chen, J., Froese, V., Niedermeier, R., Woeginger, G.J., Esparza, J., Fraigniard, P., Husfeldt, T., Koutsoupias, E.

Publikováno v: Automata, Languages, and Programming ISBN: 9783662439470
ICALP (1)
Automata, Languages, and Programming41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, ProceedingsLecture Notes in Computer Science
ICALP
ICALP, 2014, Copenhague, Denmark. ⟨10.1007/978-3-662-43948-7_15⟩
Automata, Languages and Programming (41st International Colloquium, ICALP 2014, Copenhagen, Denmark, Switzerland, July 8-11, 2014. Proceedings, Part I), 174-185
STARTPAGE=174;ENDPAGE=185;TITLE=Automata, Languages and Programming (41st International Colloquium, ICALP 2014, Copenhagen, Denmark, Switzerland, July 8-11, 2014. Proceedings, Part I)

International audience; The partition of graphs into nice subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into stars, a problem known to be NP-complete even for the case o

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c1c8840beca9e6cabeea1a074a0c9bfe
https://doi.org/10.1007/978-3-662-43948-7_15

Zobrazit plný text záznamu

Conference

Computing the Tutte Polynomial in Vertex-Exponential Time.

Autor: Bjorklund, A., Husfeldt, T., Kaski, P., Koivisto, M.

Publikováno v: 2008 49th Annual IEEE Symposium on Foundations of Computer Science; 2008, p677-686, 10p

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání