Authors: Sau, Ignasi, Stamoulis, Giannos, Thilikos, Dimitrios M.
Contributors: Agence Nationale de la Recherche
Superior Title: Journal of Graph Theory ; ISSN 0364-9024 1097-0118
Availability: https://doi.org/10.1002/jgt.23121
Superior Title: In Discrete Applied Mathematics 31 December 2023 341:40-54
Authors: Lardas, Emmanouil, Protopapas, EvangelosAff2, IDs0037302302618y_cor2, Thilikos, Dimitrios M., Zoros, Dimitris
Superior Title: Graphs and Combinatorics. 39(2)
Superior Title: In Information and Computation August 2023 293
Authors: Sau, Ignasi, Stamoulis, Giannos, Thilikos, Dimitrios M.
Superior Title: In Journal of Combinatorial Theory, Series B July 2023 161:180-227
Superior Title: In Discrete Mathematics April 2023 346(4)
Subject Terms: Graph minors, Parameterized algorithms, Graph modification problems, Vertex deletion, Elimination distance, Irrelevant vertex technique, Flat Wall Theorem, Obstructions, Theory of computation → Parameterized complexity and exact algorithms
File Description: application/pdf
Relation: http://dl.acm.org/citation.cfm?id=1347082.1347153; https://dx.doi.org/10.48550/arXiv.2210.02167; https://dx.doi.org/10.4230/LIPIcs.ICALP.2023; https://dx.doi.org/10.1137/1.9781611977073.79; https://dx.doi.org/10.4230/LIPIcs.STACS.2021.5; https://dx.doi.org/10.4230/LIPIcs.IPEC.2020.1; https://dx.doi.org/10.1137/1.9781611975994.57; https://dx.doi.org/10.1137/19M1287146; https://dx.doi.org/10.1016/j.tcs.2020.01.026; https://dx.doi.org/10.1016/j.jcss.2019.11.002; https://dx.doi.org/10.1007/3-540-55121-2_1; https://dx.doi.org/10.1007/s00453-015-0045-3; https://dx.doi.org/10.1007/s00453-016-0235-7; https://dx.doi.org/10.1007/978-3-319-21275-3; https://dx.doi.org/10.1007/978-3-662-53622-3; https://dx.doi.org/10.1007/978-1-4471-5559-1; https://dx.doi.org/10.1016/j.ejc.2011.09.014; https://dx.doi.org/10.1016/j.jcss.2021.04.005
Authors: Fomin, Fedor V., Golovach, Petr A., Sau, Ignasi, Stamoulis, Giannos, Thilikos, Dimitrios M.
Subject Terms: Algorithmic meta-theorems, Graph modification problems, Model-checking, Graph minors, First-order logic, Monadic second-order logic, Flat Wall theorem, Irrelevant vertex technique, Theory of computation → Logic, Theory of computation → Parameterized complexity and exact algorithms, Mathematics of computing → Graph algorithms
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.ICALP.2023; https://dx.doi.org/10.1137/1.9781611977073.79; https://dx.doi.org/10.1016/0196-6774(91)90006-K; https://dx.doi.org/10.1137/1.9781611975994.57; https://dx.doi.org/10.1145/167088.167161; https://dx.doi.org/10.1145/2973749; https://dx.doi.org/10.1145/3531130.3533367; https://dx.doi.org/10.1145/3519935.3520037; https://dx.doi.org/10.1109/FOCS46700.2020.00062; https://dx.doi.org/10.1007/BF01758777; https://dx.doi.org/10.4230/LIPIcs.ICALP.2020.16; https://dx.doi.org/10.1007/s00453-016-0235-7; https://dx.doi.org/10.1016/j.jcss.2008.05.002; https://dx.doi.org/10.1007/11821069_21; https://dx.doi.org/10.1016/0890-5401(90)90043-H; https://dx.doi.org/10.1051/ita/1992260302571
Availability: https://doi.org/10.4230/lipics.icalp.2023.6110.4230/LIPIcs.ICALP.202310.1137/1.9781611977073.7910.1016/0196-6774(91)90006-K10.1137/1.9781611975994.5710.1145/167088.16716110.1145/297374910.1145/3531130.353336710.1145/3519935.352003710.1109/FOCS46700.2020.0006210.1007/BF0175877710.4230/LIPIcs.ICALP.2020.1610.1007/s00453-016-0235-710.1016/j.jcss.2008.05.00210.1007/11821069_2110.1016/0890-5401(90)90043-H10.1051/ita/1992260302571
Authors: Fomin, Fedor, V., Golovach, Petr, A., Sau, Ignasi, Stamoulis, Giannos, Thilikos, Dimitrios, M.
Contributors: Department of Informatics Bergen (UiB), University of Bergen (UiB), Algorithmes, Graphes et Combinatoire (LIRMM, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), ANR-20-CE48-0008,ELIT,Un Parcours par les Limites de l'Efficacité(2020), ANR-17-CE23-0010,ESIGMA,Efficacité et structure pour les applications de la fouille de graphes(2017), ANR-20-CE92-0027,UTMA,Théories Unifiantes dans les Algorithmes Multivarieés(2020)
Superior Title: ICALP 2023 - 50th International Colloquium on Automata, Languages and Programming ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04253801 ; ICALP 2023 - 50th International Colloquium on Automata, Languages and Programming, Jul 2023, Paderborn, Germany. pp.1-21, ⟨10.4230/LIPIcs.ICALP.2023.51⟩
Subject Terms: Graph modification problems, Model-checking, Graph minors, First-order logic, Monadic second-order logic, Flat Wall theorem, Irrelevant vertex technique, [INFO]Computer Science [cs]
Subject Geographic: Germany
Time: Paderborn, Germany
Relation: lirmm-04253801; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04253801; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04253801/document; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04253801/file/compound_ICALP_camera_ready.pdf
Authors: Jaffke, Lars, Morelle, Laure, Sau, Ignasi, Thilikos, Dimitrios M.
Contributors: University of Bergen (UiB), Algorithmes, Graphes et Combinatoire (LIRMM, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), ANR-20-CE48-0008,ELIT,Un Parcours par les Limites de l'Efficacité(2020), ANR-20-CE92-0027,UTMA,Théories Unifiantes dans les Algorithmes Multivarieés(2020)
Superior Title: IPEC 2023 - 18th International Symposium on Parameterized and Exact Computation ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04253839 ; IPEC 2023 - 18th International Symposium on Parameterized and Exact Computation, Sep 2023, Amsterdam, Netherlands. pp.16:1-16:22, ⟨10.4230/LIPIcs.IPEC.2023.26⟩
Subject Terms: Tree decompositions, Bipartite graphs, Dynamic programming, Odd minors, Packing and covering, Maximum cut, Vertex cover, Independent set, Odd cycle transversal, [INFO]Computer Science [cs]
Subject Geographic: Amsterdam, Netherlands
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2309.07754; lirmm-04253839; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04253839; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04253839/document; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04253839/file/biptw_camera.pdf; ARXIV: 2309.07754
Contributors: Algorithmes, Graphes et Combinatoire (LIRMM, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Society for Industrial and Applied Mathematics, ANR-19-CE48-0013,DIGRAPHS,Digraphes(2019), ANR-17-CE23-0010,ESIGMA,Efficacité et structure pour les applications de la fouille de graphes(2017), ANR-20-CE92-0027,UTMA,Théories Unifiantes dans les Algorithmes Multivarieés(2020)
Superior Title: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ; SODA 2023 - ACM-SIAM Symposium on Discrete Algorithms ; https://hal.science/hal-04042995 ; SODA 2023 - ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Jan 2023, Florence, Italy. pp.3654-3663, ⟨10.1137/1.9781611977554.ch139⟩ ; https://epubs.siam.org/doi/book/10.1137/1.9781611977554
Subject Terms: Kernelization, Parameterized algorithms, Rainbow matching, Packing problems, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
Time: Florence, Italy
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2207.06874; hal-04042995; https://hal.science/hal-04042995; https://hal.science/hal-04042995/document; https://hal.science/hal-04042995/file/2207.06874.pdf; ARXIV: 2207.06874
Contributors: University of Bergen (UiB), Algorithmes, Graphes et Combinatoire (LIRMM, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Society for Industrial and Applied Mathematics, ANR-16-CE40-0028,DE-MO-GRAPH,Décomposition de Modèles Graphiques(2016), ANR-17-CE23-0010,ESIGMA,Efficacité et structure pour les applications de la fouille de graphes(2017), ANR-20-CE92-0027,UTMA,Théories Unifiantes dans les Algorithmes Multivarieés(2020)
Superior Title: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ; SODA 2023 - ACM-SIAM Symposium on Discrete Algorithms ; https://hal.science/hal-04043007 ; SODA 2023 - ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Jan 2023, Florence, Italy. pp.3684-3699, ⟨10.1137/1.9781611977554.ch141⟩ ; https://epubs.siam.org/doi/book/10.1137/1.9781611977554
Subject Terms: Algorithmic meta-theorems, Model-checking, First-order logic, Disjoint paths, Hadwiger number, Graph minors, Irrelevant vertex technique, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Time: Florence, Italy
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2211.01723; hal-04043007; https://hal.science/hal-04043007; https://hal.science/hal-04043007/document; https://hal.science/hal-04043007/file/2211.01723.pdf; ARXIV: 2211.01723
Authors: Baste, Julien, Sau, Ignasi, Thilikos, Dimitrios M.
Contributors: Operational Research, Knowledge And Data (ORKAD), Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Algorithmes, Graphes et Combinatoire (LIRMM, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), ANR-16-CE40-0028,DE-MO-GRAPH,Décomposition de Modèles Graphiques(2016), ANR-17-CE23-0010,ESIGMA,Efficacité et structure pour les applications de la fouille de graphes(2017), ANR-20-CE48-0008,ELIT,Un Parcours par les Limites de l'Efficacité(2020), ANR-20-CE92-0027,UTMA,Théories Unifiantes dans les Algorithmes Multivarieés(2020)
Superior Title: ISSN: 0097-5397 ; SIAM Journal on Computing ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04171495 ; SIAM Journal on Computing, 2023, 52 (4), pp.865-912. ⟨10.1137/21M140482X⟩.
Subject Terms: Parameterized algorithms, Graph minors, Treewidth, Hitting minors, Flat Wall Theorem, Irrelevant vertex, Dynamic programming, Complexity dichotomy, [INFO]Computer Science [cs], [MATH]Mathematics [math]
Relation: lirmm-04171495; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04171495; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04171495/document; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04171495/file/SICOMP-M140482-R1.pdf
Authors: Schirrmacher, Nicole, Siebertz, Sebastian, Stamoulis, Giannos, Thilikos, Dimitrios M., Vigny, Alexandre
Subject Terms: Computer Science - Logic in Computer Science
Relation: http://arxiv.org/abs/2302.07033
Availability: http://arxiv.org/abs/2302.07033
Authors: Thilikos, Dimitrios M., Wiederrecht, Sebastian
Subject Terms: Mathematics - Combinatorics, Computer Science - Discrete Mathematics, 05C83, 05C85, 05C75, 68R10, 68Q27, G.2.2
Relation: http://arxiv.org/abs/2304.04517
Availability: http://arxiv.org/abs/2304.04517
Relation: http://arxiv.org/abs/2304.03688
Availability: http://arxiv.org/abs/2304.03688
Subject Terms: Computer Science - Discrete Mathematics, Mathematics - Combinatorics, 05C85, 05C83, 05C75, G.2.2
Relation: http://arxiv.org/abs/2304.14121
Availability: http://arxiv.org/abs/2304.14121
Authors: Thilikos, Dimitrios M., Wiederrecht, Sebastian
Relation: http://arxiv.org/abs/2306.01724
Availability: http://arxiv.org/abs/2306.01724
Authors: Diner, Öznur YaşarAff1, Aff2, Giannopoulou, Archontia C.Aff3, IDs0037302202513y_cor2, Stamoulis, GiannosAff3, Aff4, Thilikos, Dimitrios M.
Superior Title: Graphs and Combinatorics. 38(5)
Authors: Baste, Julien, Thilikos, Dimitrios M.Aff2, IDs0045302100912w_cor2
Superior Title: Algorithmica. 84(2):510-531