المؤلفون: 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

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

المساهمون: Department of Informatics [Bergen] (UiB), University of Bergen (UiB), Algorithmes, Graphes et Combinatoire (ALGCO), 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)

المصدر: Graph-Theoretic Concepts in Computer Science
Graph-Theoretic Concepts in Computer Science, 12911, Springer International Publishing, pp.308-320, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-86838-3_24⟩
Graph-Theoretic Concepts in Computer Science ISBN: 9783030868376
WG

مصطلحات موضوعية: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], 0209 industrial biotechnology, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Rendezvous, Parameterized complexity, 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Graph, Vertex (geometry), Combinatorics, 020901 industrial engineering & automation, 010201 computation theory & mathematics, Chordal graph, Time complexity, PSPACE, Mathematics, MathematicsofComputing_DISCRETEMATHEMATICS

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3545fe91e1b16136a512e9056b17dcdfTest
https://hal.archives-ouvertes.fr/hal-03390090/documentTest

المؤلفون: Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi

المساهمون: Laboratoire de Génie Informatique, de Production et de Maintenance (LGIPM), Université de Lorraine (UL)

المصدر: Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2019, 754, pp.3-15. ⟨10.1016/j.tcs.2018.02.014⟩

مصطلحات موضوعية: General Computer Science, Mathematics::General Topology, Graph theory, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences, Upper and lower bounds, Graph, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Theoretical Computer Science, Combinatorics, Set (abstract data type), 010201 computation theory & mathematics, Dominating set, 0202 electrical engineering, electronic engineering, information engineering, Enumeration, 020201 artificial intelligence & image processing, Graph algorithms, ComputingMilieux_MISCELLANEOUS, Computer Science::Databases, Mathematics, Complement (set theory)

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95d07c46b3bab1385ce20a12cb8f5202Test
https://doi.org/10.1016/j.tcs.2018.02.014Test

المؤلفون: Golovach, Petr A., Paulusma, Daniël, Leeuwen, Erik Jan van, Sub Algorithms and Complexity, Algorithms and Complexity

المساهمون: Sub Algorithms and Complexity, Algorithms and Complexity

المصدر: Journal of Computer and System Sciences, 124, 170. Academic Press Inc.
Journal of computer and system sciences, 2022, Vol.124, pp.170-191 [Peer Reviewed Journal]

مصطلحات موضوعية: FOS: Computer and information sciences, Co-bipartite graph, Discrete Mathematics (cs.DM), General Computer Science, Induced topological minor, Computer Networks and Communications, Minor (linear algebra), 0102 computer and information sciences, Disjoint sets, Computational Complexity (cs.CC), 01 natural sciences, W[1]-hardness, Polynomial-time algorithm, Theoretical Computer Science, Combinatorics, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Disjoint paths, 0101 mathematics, Time complexity, Mathematics, Applied Mathematics, 010102 general mathematics, k-in-a-Path, 16. Peace & justice, Graph, AT-free graph, k-in-a-Tree, Computer Science - Computational Complexity, Computational Theory and Mathematics, 010201 computation theory & mathematics, Combinatorics (math.CO), Computer Science - Discrete Mathematics

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

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2b35e301d0774a11d3f5d5b2034c4139Test
https://doi.org/10.1016/j.jcss.2021.10.003Test

المؤلفون: Matthew Johnson, Daniël Paulusma, Barnaby Martin, Anthony Stewart, Petr A. Golovach

المصدر: Computability, 2019, Vol.8(1), pp.27-42 [Peer Reviewed Journal]

مصطلحات موضوعية: Surjective function, Combinatorics, Computational Theory and Mathematics, Computational complexity theory, Artificial Intelligence, Homomorphism, Connectivity, Graph, Computer Science Applications, Theoretical Computer Science, Mathematics, Vertex (geometry)

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

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e768fff762270dc05d4090cb6a3f8243Test
https://doi.org/10.3233/com-180084Test

المؤلفون: Fedor V. Fomin, Dušan Knop, Steven Chaplick, Peter Zeman, Petr A. Golovach

المساهمون: Dept. of Advanced Computing Sciences, RS: FSE DACS Mathematics Centre Maastricht, RS: FSE DACS

المصدر: SIAM Journal on Discrete Mathematics
Siam Journal on Discrete Mathematics, 35(2), 840-892. SIAM Publications

مصطلحات موضوعية: Polynomial, TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, General Mathematics, 0102 computer and information sciences, proper H-graphs, 01 natural sciences, Combinatorics, symbols.namesake, PATHS, Cycle cover, TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, path cover, INTERVAL-GRAPHS, Mathematics, Discrete mathematics, Path cover, Hamiltonian path, Graph, 010201 computation theory & mathematics, Kernelization, kernelization, symbols, LOG N) ALGORITHM, MathematicsofComputing_DISCRETEMATHEMATICS, Data compression, cycle cover, CIRCUITS

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

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e89b056b96589b69d932b5daf479773aTest
https://hdl.handle.net/11250/2976040Test

المؤلفون: Fedor V. Fomin, Torstein J. F. Strømme, Petr A. Golovach, Dimitrios M. Thilikos

المساهمون: Algorithmes, Graphes et Combinatoire (ALGCO), 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)

المصدر: Algorithmica
Algorithmica, Springer Verlag, 2020, 82 (7), pp.1859-1880. ⟨10.1007/s00453-020-00677-8⟩

مصطلحات موضوعية: Mathematics::Combinatorics, General Computer Science, Applied Mathematics, 010102 general mathematics, Degenerate energy levels, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], MathematicsofComputing_GENERAL, 0102 computer and information sciences, 01 natural sciences, Graph, Computer Science Applications, Combinatorics, 010201 computation theory & mathematics, Computer Science::Discrete Mathematics, TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, Bipartite graph, 0101 mathematics, [MATH]Mathematics [math], Time complexity, MathematicsofComputing_DISCRETEMATHEMATICS, Mathematics

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

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2bc574258ca35742a7a80659b322312bTest
https://hal.archives-ouvertes.fr/hal-03002656/documentTest

المؤلفون: Reza Saei, Pinar Heggernes, Dieter Kratsch, Petr A. Golovach

المساهمون: Laboratoire de Génie Informatique, de Production et de Maintenance (LGIPM), Université de Lorraine (UL)

المصدر: Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2020, 278, pp.3-11. ⟨10.1016/j.dam.2019.07.015⟩

مصطلحات موضوعية: Vertex (graph theory), Mathematics::Combinatorics, Applied Mathematics, 0211 other engineering and technologies, 021107 urban & regional planning, Enumeration algorithm, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Graph, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Combinatorics, 010201 computation theory & mathematics, Chordal graph, Enumeration, Discrete Mathematics and Combinatorics, Graph algorithms, ComputingMilieux_MISCELLANEOUS, MathematicsofComputing_DISCRETEMATHEMATICS, Mathematics

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c57434109186a207c354fc204d7e7f7Test
https://hal.univ-lorraine.fr/hal-03242329Test

المؤلفون: Saket Saurabh, Abhishek Sahu, Petr A. Golovach, R. Krithika, Meirav Zehavi

المصدر: LATIN 2020: Theoretical Informatics ISBN: 9783030617912
LATIN

مصطلحات موضوعية: Parameterized complexity, Interval graph, 0102 computer and information sciences, 02 engineering and technology, Path cover, 01 natural sciences, Hamiltonian path, Graph, Combinatorics, Dynamic programming, symbols.namesake, 010201 computation theory & mathematics, Chordal graph, 0202 electrical engineering, electronic engineering, information engineering, symbols, 020201 artificial intelligence & image processing, MathematicsofComputing_DISCRETEMATHEMATICS, Mathematics, Data compression

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_________::df03dd31305b505295f4b0453cbc20f0Test
https://doi.org/10.1007/978-3-030-61792-9_9Test