Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Theory of computation ��� W hierarchy"'
Publikováno v:
European Symposium on Algorithms
European Symposium on Algorithms, Sep 2022, Potsdam, Germany. ⟨10.4230/LIPIcs.ESA.2022.15⟩
European Symposium on Algorithms, Sep 2022, Potsdam, Germany. ⟨10.4230/LIPIcs.ESA.2022.15⟩
Given a graph G and two independent sets I_s and I_t of size k, the Independent Set Reconfiguration problem asks whether there exists a sequence of independent sets (each of size k) I_s = I₀, I₁, I₂, …, I_𝓁 = I_t such that each independent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::32cb482b0dcc4379c62ba1c24b6d4c19
https://hal.science/hal-03829754
https://hal.science/hal-03829754
We investigate the parameterized complexity of Binary CSP parameterized by the vertex cover number and the treedepth of the constraint graph, as well as by a selection of related modulator-based parameters. The main findings are as follows: - Binary
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f2cc022aedd9e5fdd1782dc836ffc19
http://arxiv.org/abs/2208.12543
http://arxiv.org/abs/2208.12543
When computing stable matchings, it is usually assumed that the preferences of the agents in the matching market are fixed. However, in many realistic scenarios, preferences change over time. Consequently, an initially stable matching may become unst
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95527817235794f7212e732747fd4154
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 0:i-0:xxii
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 0:i-0:xxii
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c19753a37740f965274159d7f92b57a5
We provide new (parameterized) computational hardness results for Interval Scheduling on Unrelated Machines. It is a classical scheduling problem motivated from just-in-time or lean manufacturing, where the goal is to complete jobs exactly at their d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3621a92a9ab6a95d3c78d6b75b3c2a3e
LIPIcs, Volume 244, ESA 2022, Complete Volume
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 1-1406
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 1-1406
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ee4feba6a7425c51d63f41832c606963
https://drops.dagstuhl.de/opus/volltexte/2022/16937/
https://drops.dagstuhl.de/opus/volltexte/2022/16937/
LIPIcs, Volume 144, ESA'19, Complete Volume
LIPIcs, Vol. 144, 27th Annual European Symposium on Algorithms (ESA 2019), pages 0-0
LIPIcs, Vol. 144, 27th Annual European Symposium on Algorithms (ESA 2019), pages 0-0
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::34a8b6b3f55835346da65632604b86fe
https://drops.dagstuhl.de/opus/volltexte/2019/11300/
https://drops.dagstuhl.de/opus/volltexte/2019/11300/