Výsledky vyhledávání

Autor: Hermelin, D., Mnich, M., Leeuwen, van, E.J., Woeginger, G.J., Aceto, L., Henzinger, M., Sgall, J.

Publikováno v: Automata, Languages and Programming: 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I, 462-473
STARTPAGE=462;ENDPAGE=473;TITLE=Automata, Languages and Programming
Automata, Languages and Programming ISBN: 9783642220050
ICALP (1)
Automata, Languages and Programming (38th International Colloquium, ICALP 2011, Zürich, Switzerland, July 4-8, 2011. Proceedings, Part I), 462-473
STARTPAGE=462;ENDPAGE=473;TITLE=Automata, Languages and Programming (38th International Colloquium, ICALP 2011, Zürich, Switzerland, July 4-8, 2011. Proceedings, Part I)
ACM Transactions on Algorithms, 15(2), 25:1. Association for Computing Machinery (ACM)

We algorithmize the recent structural characterization for claw-free graphs by Chudnovsky and Seymour. Building on this result, we show that Dominating Set on claw-free graphs is (i) fixed-parameter tractable and (ii) even possesses a polynomial kern

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d67a33021e6925ac52328d645212083b
https://doi.org/10.1145/3301445

Zobrazit plný text záznamu

Conference

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Conference

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms

Autor: Sgall, J., Woeginger, G., Bampis, E., Svensson, O.

Publikováno v: Approximation and Online Algorithms ISBN: 9783319182629
WAOA
Approximation and Online Algorithms (12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers), 236-247
STARTPAGE=236;ENDPAGE=247;TITLE=Approximation and Online Algorithms (12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers)

We study online preemptive makespan minimization on \(m\) parallel machines, where the (multiprocessor) jobs arrive over time and have widths from some fixed set \(W\subseteq \{1,2,\ldots ,m\}\). For every number \(m\) of machines we concisely charac

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::60b92ff5f19adf94c0fa21f5729d0627
https://doi.org/10.1007/978-3-319-18263-6_20

Zobrazit plný text záznamu

Automata-Based CSL Model Checking

Autor: Zhang, L., Jansen, D.N., Nielson, F., Hermanns, H., Aceto, L., Henzinger, M., Sgall, J.

Publikováno v: Aceto, L.; Henzinger, M.; Sgall, J. (ed.), Automata, Languages and Programming, pp. 271-282
Automata, Languages and Programming ISBN: 9783642220111
ICALP (2)
Lecture Notes in Computer Science ; 6756, 271-282. Berlin : Springer
STARTPAGE=271;ENDPAGE=282;TITLE=Lecture Notes in Computer Science ; 6756

For continuous-time Markov chains, the model-checking problem with respect to continuous-time stochastic logic (CSL) has been introduced and shown to be decidable by Aziz, Sanwal, Singhal and Brayton in 1996. The presented decision procedure, however

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fe9eaa2e9598ee237bf302667e48a79d
https://doi.org/10.1007/978-3-642-22012-8_21

Zobrazit plný text záznamu

Constructing differential categories and deconstructing categories of games

Autor: Laird, J., Manzonetto, G., McCusker, G., Aceto, L., Henzinger, M., Sgall, J.

Publikováno v: Laird, J, Manzonetto, G & McCusker, G 2011, Constructing differential categories and deconstructing categories of games . in L Aceto, M Henzinger & J Sgall (eds), Automata, Languages and Programming-38th International Colloquium, ICALP 2011, Proceedings . Lecture Notes in Computer Science, vol. 6756, Springer, Heidelberg, Germany, pp. 186-197 . https://doi.org/10.1007/978-3-642-22012-8_14
Lecture Notes in Computer Science ; 6756, 186-197. Berlin : Springer
STARTPAGE=186;ENDPAGE=197;TITLE=Lecture Notes in Computer Science ; 6756
Automata, Languages and Programming ISBN: 9783642220111
ICALP (2)
Aceto, L.; Henzinger, M.; Sgall, J. (ed.), Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II, pp. 186-197

We present an abstract construction for building differential categories useful to model resource sensitive calculi, and we apply it to categories of games. In one instance, we recover a category previously used to give a fully abstract model of a no

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7e8f461554fedf79abca5f48860ddffc
https://purehost.bath.ac.uk/ws/files/264667/diff.pdf

Zobrazit plný text záznamu

Random shortest paths: non-euclidean instances for metric optimization problems

Autor: Bringmann, Karl, Engels, Christian, Manthey, Bodo, Rao, B.V. Raghavendra, Chatterjee, K., Sgall, J.

Publikováno v: Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013), 219-230
STARTPAGE=219;ENDPAGE=230;TITLE=Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013)
Mathematical Foundations of Computer Science 2013 ISBN: 9783642403125
MFCS

Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidean instances, but little is known about metric instances drawn from distributions other than the Euclidean. This motivates our study of random metric i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb87d8f38f93dea82c597ea90cda3031
https://research.utwente.nl/en/publications/5ba14c17-ba7e-49bf-93ce-4d1e46d135a4

Zobrazit plný text záznamu

Conference

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width

Autor: Bordewich, M., Kang, Ross, Aceto, Luca, Henzinger, M., Sgall, J.

Motivated by the ‘subgraphs world’ view of the ferromagnetic Ising model, we analyse the mixing times of Glauber dynamics based on subset expansion expressions for classes of graph, hypergraph and matroid polynomials. With a canonical paths argum

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::69e0508b788f188825807f918ee1a5e9
https://ir.cwi.nl/pub/19909

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání