Authors: Dreier, Jan, Ordyniak, Sebastian^{Aff2, IDs10601023093623_cor2}, Szeider, Stefan

Superior Title: Constraints: An International Journal. 28(3):450-471

Authors: Dreier, Jan, Ordyniak, Sebastian, Szeider, Stefan

Superior Title: In Journal of Computer and System Sciences June 2024 142

Authors: Ganian, Robert, Ordyniak, Sebastian, Rahul, C. S.^{Aff3, IDs0045302201058z_cor3}

Superior Title: Algorithmica. 85(5):1111-1155

Authors: Ordyniak, Sebastian, Schidler, Andre, Szeider, Stefan

Superior Title: In Journal of Computer and System Sciences May 2024

Authors: Dabrowski, Konrad K., Jonsson, Peter, Ordyniak, Sebastian, Osipov, George

Superior Title: In Artificial Intelligence April 2023 317

Authors: Bulteau, Laurent^Aff9, Dabrowski, Konrad K.^Aff10, Köhler, Noleen^Aff11, Ordyniak, Sebastian^Aff12, Paulusma, Daniël^Aff13

Contributors: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Yung, Moti, Editorial Board Member^Aff6, Bekos, Michael A., editor^Aff7, Kaufmann, Michael, editor^Aff8

Superior Title: Graph-Theoretic Concepts in Computer Science : 48th International Workshop, WG 2022, Tübingen, Germany, June 22–24, 2022, Revised Selected Papers. 13453:114-128

Authors: Bodlaender, Hans, L, Bonnet, Edouard, Jaffke, Lars, Knop, Dušan, Lima, Paloma, T, Milanič, Martin, Ordyniak, Sebastian, Pandey, Sukanya, Suchý, Ondřej

Contributors: LIP, Modèles de calcul, Complexité, Combinatoire (MC2), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), ANR-21-CE48-0014,TWIN-WIDTH,Twin-width: théorie et applications(2021)

Superior Title: IPEC 2023 ; https://hal.science/hal-04292980 ; IPEC 2023, Sep 2023, Amsterdam, Netherlands

Subject Terms: [INFO]Computer Science [cs], [MATH]Mathematics [math]

Subject Geographic: Amsterdam, Netherlands

Relation: hal-04292980; https://hal.science/hal-04292980; https://hal.science/hal-04292980/document; https://hal.science/hal-04292980/file/NP_completeness_for_Bounded_Degree_Treewidth.pdf

Availability: https://hal.science/hal-04292980
https://hal.science/hal-04292980/document
https://hal.science/hal-04292980/file/NP_completeness_for_Bounded_Degree_Treewidth.pdf

Authors: Bodlaender, Hans L., Bonnet, Édouard, Jaffke, Lars, Knop, Dušan, Lima, Paloma T., Milanič, Martin, Ordyniak, Sebastian, Pandey, Sukanya, Suchý, Ondřej

Subject Terms: Treewidth, cubic graphs, degree, NP-completeness, Theory of computation → Problems, reductions and completeness

File Description: application/pdf

Relation: https://dx.doi.org/10.4230/LIPIcs.IPEC.2023; https://dx.doi.org/10.1137/0608024; https://dx.doi.org/10.1137/0607033; https://dx.doi.org/10.1016/S0304-3975(97)00228-4; https://dx.doi.org/10.1016/S0166-218X(97)00031-0; https://dx.doi.org/10.1016/0020-0190(92)90234-M; https://dx.doi.org/10.1016/0304-3975(88)90028-X; https://dx.doi.org/10.1007/BF01215352

Availability: https://doi.org/10.4230/lipics.ipec.2023.710.4230/LIPIcs.IPEC.202310.1137/060802410.1137/060703310.1016/S0304-3975(97)00228-410.1016/S0166-218X(97)00031-010.1016/0020-0190(92)90234-M10.1016/0304-3975(88)90028-X10.1007/BF01215352

Authors: Dabrowski, Konrad K., Jonsson, Peter, Ordyniak, Sebastian, Osipov, George, Pilipczuk, Marcin, Sharma, Roohani

Subject Terms: minimum constraint satisfaction problem, Allen’s interval algebra, parameterized complexity, cut problems, Theory of computation → Parameterized complexity and exact algorithms

File Description: application/pdf

Relation: https://dx.doi.org/10.4230/LIPIcs.IPEC.2023

Availability: https://doi.org/10.4230/lipics.ipec.2023.1110.4230/LIPIcs.IPEC.2023

Authors: Eiben, Eduard, Ganian, Robert, Kanj, Iyad, Ordyniak, Sebastian, Szeider, Stefan

Subject Terms: Independent Set, Powers of Hypercubes, Diversity, Parameterized Complexity, Incomplete Data, Theory of computation → Parameterized complexity and exact algorithms

File Description: application/pdf

Relation: https://dx.doi.org/10.4230/LIPIcs.IPEC.2023; https://dx.doi.org/10.1007/978-1-4471-5559-1; https://dx.doi.org/10.1609/aaai.v35i8.16896

Availability: https://doi.org/10.4230/lipics.ipec.2023.1610.4230/LIPIcs.IPEC.202310.1007/978-1-4471-5559-110.1609/aaai.v35i8.16896

Authors: Eiben, Eduard, Ganian, Robert, Hamm, Thekla, Ordyniak, Sebastian

Superior Title: In Artificial Intelligence February 2023 315

Authors: Gaspers, Serge, Koivisto, Mikko, Liedloff, Mathieu, Ordyniak, Sebastian, Szeider, Stefan

Contributors: Department of Computer Science

Subject Terms: 111 Mathematics

File Description: application/pdf

Relation: https://doi.org/10.1609/aaai.v26i1.8217; Proceedings of the AAAI Conference on Artificial Intelligence; Gaspers , S , Koivisto , M , Liedloff , M , Ordyniak , S & Szeider , S 2021 , ' On Finding Optimal Polytrees ' , Proceedings of the AAAI Conference on Artificial Intelligence , vol. 26 , no. 1 , pp. 750-756 . https://doi.org/10.1609/aaai.v26i1.8217; PURE: 257136784; PURE UUID: 8c270bcc-40e2-4876-9ab8-f65c832b3853; Bibtex: Gaspers_Koivisto_Liedloff_Ordyniak_Szeider_2021; ORCID: /0000-0001-9662-3605/work/130145013; http://hdl.handle.net/10138/355317; https://ojs.aaai.org/index.php/AAAI/article/view/8217

Availability: https://doi.org/10.1609/aaai.v26i1.8217
http://hdl.handle.net/10138/355317
https://ojs.aaai.org/index.php/AAAI/article/view/8217

Authors: Dabrowski, Konrad, Jonsson, Peter, Ordyniak, Sebastian, Osipov, George, Wahlström, Magnus

Superior Title: Dabrowski , K , Jonsson , P , Ordyniak , S , Osipov , G & Wahlström , M 2023 , Almost Consistent Systems of Linear Equations . in SODA 2023 . SIAM , pp. 3179-3217 . https://doi.org/10.1137/1.9781611977554.ch121

File Description: application/pdf

Availability: https://doi.org/10.1137/1.9781611977554.ch121
https://rhul.elsevierpure.com/en/publications/1ca5c49e-a44f-4944-8a79-a8ca625d3f96
https://pure.royalholloway.ac.uk/ws/files/47169034/SODA23_final.pdf

Authors: Fichte, Johannes K., Ganian, Robert, Hecher, Markus, Slivovsky, Friedrich, Ordyniak, Sebastian

Subject Terms: Computer Science - Logic in Computer Science, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Mathematics - Logic

Relation: http://arxiv.org/abs/2304.13896

Availability: http://arxiv.org/abs/2304.13896

Authors: Bodlaender, Hans L., Bonnet, Édouard, Jaffke, Lars, Knop, Dušan, Lima, Paloma T., Milanič, Martin, Ordyniak, Sebastian, Pandey, Sukanya, Suchý, Ondřej

Subject Terms: Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Mathematics - Combinatorics

Relation: http://arxiv.org/abs/2301.10031

Availability: http://arxiv.org/abs/2301.10031

Authors: Dreier, Jan, Ordyniak, Sebastian, Szeider, Stefan

Subject Terms: satisfiability, backdoor depth, Theory of computation → Fixed parameter tractability

File Description: application/pdf

Relation: https://dx.doi.org/10.4230/LIPIcs.ESA.2022; https://dx.doi.org/10.1017/9781108637435.032; https://dx.doi.org/10.1007/978-3-319-66263-3_2; https://dx.doi.org/10.4230/LIPIcs.STACS.2017.36; https://dx.doi.org/10.1145/3014587; https://dx.doi.org/10.1016/j.jcss.2016.10.007; https://dx.doi.org/10.1007/s00453-014-9958-5; https://dx.doi.org/10.1145/3051095; https://dx.doi.org/10.4230/LIPIcs.MFCS.2021.73; https://dx.doi.org/10.1093/comjnl/bxm048; https://dx.doi.org/10.24963/ijcai.2021/194

Availability: https://doi.org/10.4230/lipics.esa.2022.4610.4230/LIPIcs.ESA.202210.1017/9781108637435.03210.1007/978-3-319-66263-3_210.4230/LIPIcs.STACS.2017.3610.1145/301458710.1016/j.jcss.2016.10.00710.1007/s00453-014-9958-510.1145/305109510.4230/LIPIcs.MFCS.2021.7310.1093/comjnl/bxm04810.24963/ijcai.2021/194

Authors: Eiben, Eduard, Ganian, Robert, Kanj, Iyad, Ordyniak, Sebastian, Szeider, Stefan

Subject Terms: Parameterized complexity, incomplete data, clustering, Theory of computation → Parameterized complexity and exact algorithms

File Description: application/pdf

Relation: https://dx.doi.org/10.4230/LIPIcs.ESA.2022; https://dx.doi.org/10.1007/978-1-4471-5559-1

Availability: https://doi.org/10.4230/lipics.esa.2022.4710.4230/LIPIcs.ESA.202210.1007/978-1-4471-5559-1

Authors: Dreier, Jan, Ordyniak, Sebastian, Szeider, Stefan

Subject Terms: CSP, backdoor depth, constraint language, tractable class, recursive backdoor, Theory of computation → Fixed parameter tractability

File Description: application/pdf

Relation: https://dx.doi.org/10.4230/LIPIcs.CP.2022; https://dx.doi.org/10.1145/1970398.1970400; https://dx.doi.org/10.1145/2528400; https://dx.doi.org/10.1109/FOCS.2017.37; https://dx.doi.org/10.1016/0004-3702(94)90021-3; https://dx.doi.org/10.4230/LIPIcs.STACS.2017.36; https://dx.doi.org/10.1145/3014587; https://dx.doi.org/10.1016/j.jcss.2016.10.007; https://dx.doi.org/10.4230/LIPIcs.MFCS.2021.73; https://dx.doi.org/10.24963/ijcai.2021/194; https://dx.doi.org/10.3233/FAIA201000; https://dx.doi.org/10.1109/FOCS.2017.38

Availability: https://doi.org/10.4230/lipics.cp.2022.2010.4230/LIPIcs.CP.202210.1145/1970398.197040010.1145/252840010.1109/FOCS.2017.3710.1016/0004-3702(94)90021-310.4230/LIPIcs.STACS.2017.3610.1145/301458710.1016/j.jcss.2016.10.00710.4230/LIPIcs.MFCS.2021.7310.24963/ijcai.2021/19410.3233/FAIA20100010.1109/FOCS.2017.38

Authors: Eiben, Eduard, Ganian, Robert, Kanj, Iyad, Ordyniak, Sebastian, Szeider, Stefan

Subject Terms: Data Structures and Algorithms cs.DS, FOS Computer and information sciences

Availability: https://doi.org/10.48550/arxiv.2312.07628
https://arxiv.org/abs/2312.07628

Authors: Eiben, Eduard, Ganian, Robert, Kanj, Iyad, Ordyniak, Sebastian, Szeider, Stefan

Subject Terms: Machine Learning cs.LG, Computational Complexity cs.CC, Data Structures and Algorithms cs.DS, FOS Computer and information sciences

Availability: https://doi.org/10.48550/arxiv.2312.07103
https://arxiv.org/abs/2312.07103