المؤلفون: Fomin, Fedor V., Golovach, Petr A., Inamdar, Tanmay, Saurabh, Saket

المساهمون: Fedor V. Fomin and Petr A. Golovach and Tanmay Inamdar and Saket Saurabh

مصطلحات موضوعية: Subexponential Algorithms, Geometric Intersection Graphs, Treedepth, Treewidth

وصف الملف: application/pdf

العلاقة: Is Part Of LIPIcs, Volume 213, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021); urn:nbn:de:0030-drops-155323; https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.21Test

الإتاحة: https://doi.org/10.4230/LIPIcs.FSTTCS.2021.21Test
https://nbn-resolving.org/urn:nbn:de:0030-drops-155323Test

المؤلفون: Golovach, Petr A., Stamoulis, Giannos, Thilikos, Dimitrios M.

المساهمون: Department of Informatics Bergen (UiB), University of Bergen (UiB), National and Kapodistrian University of Athens (NKUA), Algorithmes, Graphes et Combinatoire (ALGCO), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS), 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)

المصدر: SODA 2020 - 31st Annual ACM-SIAM Symposium on Discrete Algorithms ; https://hal.science/hal-03003167Test ; SODA 2020 - 31st Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, UT, United States. pp.931-950, ⟨10.1137/1.9781611975994.56⟩

مصطلحات موضوعية: Design and analysis of algorithms, Graph algorithms, Topological minors, irrelevant vertex technique, treewidth, vertex deletion problems, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

جغرافية الموضوع: Salt Lake City, UT, United States

العلاقة: info:eu-repo/semantics/altIdentifier/arxiv/1907.02919; hal-03003167; https://hal.science/hal-03003167Test; https://hal.science/hal-03003167/documentTest; https://hal.science/hal-03003167/file/1907.02919.pdfTest; ARXIV: 1907.02919

الإتاحة: https://doi.org/10.1137/1.9781611975994.56Test
https://hal.science/hal-03003167Test
https://hal.science/hal-03003167/documentTest
https://hal.science/hal-03003167/file/1907.02919.pdfTest

المؤلفون: GOLOVACH, PETR A.¹ petr.golovach@uib.no, STAMOULIS, GIANNOS² giannos.stamoulis@lirmm.fr, THILIKOS, DIMITRIOS M.¹ sedthilk@thilikos.info

المصدر: SIAM Journal on Discrete Mathematics. 2023, Vol. 37 Issue 4, p2332-2364. 33p.

المؤلفون: GOLOVACH, PETR A., STAMOULIS, GIANNOS, THILIKOS, DIMITRIOS M.

المصدر: ACM Transactions on Algorithms; Jul2023, Vol. 19 Issue 3, p1-29, 29p

مصطلحات موضوعية: MINORS, PLANAR graphs, INTEGERS

المؤلفون: Golovach, Petr A., Kamiński, Marcin, Maniatis, Spyridon, Thilikos, Dimitrios M.

المساهمون: Department of Informatics Bergen (UiB), University of Bergen (UiB), Faculty of Mathematics, Informatics, and Mechanics Warsaw (MIMUW), University of Warsaw (UW), Department of Mathematics Athens, National and Kapodistrian University of Athens (NKUA), Algorithmes, Graphes et Combinatoire (ALGCO), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)

المصدر: ISSN: 0895-4801 ; SIAM Journal on Discrete Mathematics ; https://hal.umontpellier.fr/hal-01632332Test ; SIAM Journal on Discrete Mathematics, 2017, 31 (1), pp.511 - 541. ⟨10.1137/141000014⟩.

مصطلحات موضوعية: parameterized complexity, cyclability, linkages, treewidth, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

العلاقة: hal-01632332; https://hal.umontpellier.fr/hal-01632332Test; https://hal.umontpellier.fr/hal-01632332/documentTest; https://hal.umontpellier.fr/hal-01632332/file/1412.3955.pdfTest

الإتاحة: https://doi.org/10.1137/141000014Test
https://hal.umontpellier.fr/hal-01632332Test
https://hal.umontpellier.fr/hal-01632332/documentTest
https://hal.umontpellier.fr/hal-01632332/file/1412.3955.pdfTest

المؤلفون: Fomin, Fedor V., Golovach, Petr A., Thilikos, Dimitrios M.

المساهمون: Fedor V. Fomin and Petr A. Golovach and Dimitrios M. Thilikos

مصطلحات موضوعية: Graph, Hypergraph, Hypertree width, Treewidth

وصف الملف: application/pdf

العلاقة: Is Part Of LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009); urn:nbn:de:0030-drops-18034; https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1803Test

الإتاحة: https://doi.org/10.4230/LIPIcs.STACS.2009.1803Test
https://nbn-resolving.org/urn:nbn:de:0030-drops-18034Test

المؤلفون: Fomin, Fedor, Golovach, Petr, Thilikos, Dimitrios

المصدر: Leibniz International Proceedings in Informatics ; 445-456 ; 3

مصطلحات موضوعية: Graph, Hypergraph, Hypertree width, Treewidth, VDP::Matematikk og naturvitenskap: 400::Matematikk: 410, VDP::Mathematics and natural scienses: 400::Mathematics: 410

وصف الملف: application/pdf

العلاقة: urn:isbn:978-3-939897-09-5; urn:issn:1868-8969; https://hdl.handle.net/1956/12036Test; https://doi.org/10.4230/lipics.stacs.2009.1803Test; cristin:352420; Leibniz International Proceedings in Informatics 2009, 3:445-456

الإتاحة: https://doi.org/10.4230/lipics.stacs.2009.1803Test
https://hdl.handle.net/1956/12036Test

المؤلفون: Fomin, Fedor V., Golovach, Petr A.

المساهمون: Department of Informatics Bergen (UiB), University of Bergen (UiB), School of Engineering and Computing Sciences, Durham University, Christoph Dürr, Thomas Wilke

المصدر: Symposium on Theoretical Aspects of Computer Science ; STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) ; https://hal.archives-ouvertes.fr/hal-00678168Test ; STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.432-440

مصطلحات موضوعية: Parameterized complexity, Euler graph, even graph, odd graph, treewidth, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

جغرافية الموضوع: Paris, France

العلاقة: hal-00678168; https://hal.archives-ouvertes.fr/hal-00678168Test; https://hal.archives-ouvertes.fr/hal-00678168/documentTest; https://hal.archives-ouvertes.fr/hal-00678168/file/14.pdfTest

الإتاحة: https://hal.archives-ouvertes.fr/hal-00678168Test
https://hal.archives-ouvertes.fr/hal-00678168/documentTest
https://hal.archives-ouvertes.fr/hal-00678168/file/14.pdfTest

المؤلفون: Golovach, Petr A., Paulusma, Daniël, Kamiski, Marcin, Thilikos, Dimitrios M.

المساهمون: Durham University, Department of Computer Science, Faculty of Mathematics, Informatics, and Mechanics Warsaw (MIMUW), University of Warsaw (UW), Algorithmes, Graphes et Combinatoire (ALGCO), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS), Department of Mathematics Athens, National and Kapodistrian University of Athens (NKUA)

المصدر: ISSN: 0195-6698.

مصطلحات موضوعية: edge contractions, edge lifts, immersions, treewidth, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

العلاقة: hal-01083984; https://hal.science/hal-01083984Test; https://hal.science/hal-01083984/documentTest; https://hal.science/hal-01083984/file/liftcon_final.pdfTest

الإتاحة: https://doi.org/10.1016/j.ejc.2013.06.026Test
https://hal.science/hal-01083984Test
https://hal.science/hal-01083984/documentTest
https://hal.science/hal-01083984/file/liftcon_final.pdfTest

المؤلفون: Meirav Zehavi, Daniel Lokshtanov, Saket Saurabh, Fedor V. Fomin, Petr A. Golovach

المصدر: ACM Transactions on Algorithms. 15:1-27

مصطلحات موضوعية: 050101 languages & linguistics, Exponential time hypothesis, 05 social sciences, 0102 computer and information sciences, 01 natural sciences, Upper and lower bounds, Hamiltonian path, Edge dominating set, Treewidth, Combinatorics, symbols.namesake, Mathematics (miscellaneous), 010201 computation theory & mathematics, Bounded function, Clique-width, symbols, 0501 psychology and cognitive sciences, Graph coloring, Mathematics

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_________::c7a58a03de3dea3eb37029b4d8d103aeTest
https://doi.org/10.1145/3280824Test