-
1
المساهمون: Bläser, Markus, Monmege, Benjamin
المصدر: Leibniz International Proceedings in Informatics
مصطلحات موضوعية: Matroids, Diverse solutions, FOS: Computer and information sciences, Theory of computation → Fixed parameter tractability, Fixed-parameter tractable algorithms, General Mathematics, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Software
وصف الملف: application/pdf
الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::02b9f5af3742101537b9a5687586e1fcTest
https://doi.org/10.1007/s10107-023-01959-zTest -
2
المؤلفون: Kobayashi, Yasuaki, Otachi, Yota
المصدر: Algorithmica. 84:2379-2393
مصطلحات موضوعية: FOS: Computer and information sciences, General Computer Science, fixed-parameter tractability, Mathematics of computing → Graph algorithms, Applied Mathematics, Computer Science - Data Structures and Algorithms, Graph burning, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), parameterized complexity, Computer Science Applications
الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::71558a9ef79d8bf93a9e536893d2746eTest
https://doi.org/10.1007/s00453-022-00962-8Test -
3
المؤلفون: Garlet Milani, Marcelo
المصدر: Algorithmica. 84:2358-2378
مصطلحات موضوعية: FOS: Computer and information sciences, funnels, General Computer Science, parameterized algorithm, Applied Mathematics, 510 Mathematik, kernels, Computer Science Applications, Theory of computation → Fixed parameter tractability, Computer Science - Data Structures and Algorithms, directed feedback arc set, graph editing, Data Structures and Algorithms (cs.DS), ddc:510
وصف الملف: application/pdf
الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::973a043bfe623d35edcfd4bd4f144f1eTest
https://doi.org/10.1007/s00453-022-00960-wTest -
4دورية أكاديمية
مصطلحات موضوعية: Graph, Isomorphism, Canonization, Parameterized complexity, Fixed-parameter tractable, Bounded degree, Graph theory, Complexity theory, Tree-depth
وصف الملف: application/pdf
-
5
المؤلفون: Debajyoti Mondal, Giuseppe Liotta, Hamideh Vosoughpour, Anna Lubiw, Stephen G. Kobourov, Philipp Kindermann, Stephen K. Wismath, Aude Maignan, David Eppstein, Sue Whitesides
المساهمون: Department of computer science [Irvine], University of California [Irvine] (UCI), University of California-University of California, FernUniversität in Hagen, Department of Computer Science, University of Arizona, School of Computing, Università degli Studi di Perugia (UNIPG), University of Waterloo [Waterloo], Calculs Algébriques et Systèmes Dynamiques (CASYS), Laboratoire Jean Kuntzmann (LJK ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), University of Victoria [Canada] (UVIC), Department of Mathematics and Computer Science, University of Lethbridge, University of California [Irvine] (UC Irvine), University of California (UC)-University of California (UC), Università degli Studi di Perugia = University of Perugia (UNIPG), University of Manitoba [Winnipeg], Department of Computer Science [Victoria], Evangelos Kranakis, Gonzalo Navarro, Edgar Chavez
المصدر: Algorithmica
Algorithmica, Springer Verlag, 2018, 80 (3), pp.977-994. ⟨10.1007/s00453-017-0328-y⟩
Algorithmica, 2018, 80 (3), pp.977-994. ⟨10.1007/s00453-017-0328-y⟩
LATIN 2016: Theoretical Informatics ISBN: 9783662495285
LATIN
LATIN 2016: Theoretical Informatics: 12th Latin American Symposium
LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Apr 2016, Ensenada, Mexico. pp.403-415, ⟨10.1007/978-3-662-49529-2_30⟩مصطلحات موضوعية: 02 engineering and technology, 01 natural sciences, law.invention, law, Graph drawing, 0202 electrical engineering, electronic engineering, information engineering, NP-hardness, Split graph, Polyhedral graph, Mathematics, Book embedding, Fixed-parameter tractable, Applied Mathematics, Computer Science (all), Computer Science Applications1707 Computer Vision and Pattern Recognition, Approximation, Complete graphs, Genus-1 graphs, Graph theory, Planarity, Splittable, Thickness, Planarity testing, Computer Science Applications, Planar graph, 010201 computation theory & mathematics, Bounded function, Bipartite graph, symbols, 020201 artificial intelligence & image processing, Combinatorics (math.CO), General Computer Science, Symmetric graph, 0102 computer and information sciences, Combinatorics, symbols.namesake, [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], Outerplanar graph, Line graph, FOS: Mathematics, Mathematics - Combinatorics, [INFO]Computer Science [cs], 0101 mathematics, Discrete mathematics, 010102 general mathematics, 1-planar graph, Vertex (geometry), Treewidth
الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c314244445d63a5d517b5f956248e858Test
https://doi.org/10.1007/s00453-017-0328-yTest -
6
المؤلفون: Umit Bulut
المساهمون: Kırşehir Ahi Evran Üniversitesi, İktisadi ve İdari Bilimler Fakültesi, İktisat Bölümü
المصدر: Environmental Science and Pollution Research. 24:15416-15426
مصطلحات موضوعية: Renewable energy, Engineering, Turkey, Natural resource economics, 020209 energy, Health, Toxicology and Mutagenesis, 02 engineering and technology, Low-carbon economy, Carbon dioxide emissions, 010501 environmental sciences, Non-renewable energy, 01 natural sciences, Energy policy, Renewable energy credit, Energy development, Greenhouse gas emissions, 0202 electrical engineering, electronic engineering, information engineering, Environmental Chemistry, Energy economics, Physics::Atmospheric and Oceanic Physics, 0105 earth and related environmental sciences, business.industry, Environmental engineering, Environmental impact of the energy industry, General Medicine, Pollution, Fixed parameter and time-varying parameter estimation methods, Climate change mitigation, business
الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c916c23c23c1ca66701190da0323f12Test
https://doi.org/10.1007/s11356-017-9175-2Test -
7
المؤلفون: Eduard Eiben, Stefan Szeider, Robert Ganian
المصدر: Algorithmica
مصطلحات موضوعية: FOS: Computer and information sciences, General Computer Science, 0102 computer and information sciences, Fixed-parameter algorithms, 01 natural sciences, Article, law.invention, Combinatorics, law, Computer Science - Data Structures and Algorithms, Line graph, Clique-width, Data Structures and Algorithms (cs.DS), 0101 mathematics, Complement graph, Forbidden graph characterization, Mathematics, Discrete mathematics, Applied Mathematics, 010102 general mathematics, Voltage graph, Butterfly graph, Computer Science Applications, Parameterized complexity, 010201 computation theory & mathematics, Monadic second-order logic, Regular graph, Rank-width, Null graph, Computer Science(all), MathematicsofComputing_DISCRETEMATHEMATICS
الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd00741ab1d6947efaac89e2b26a09b4Test
https://doi.org/10.1007/s00453-017-0290-8Test -
8دورية أكاديمية
مصطلحات موضوعية: Fixed-parameter tractable, Parameterized complexity, Graph theory, Sparse graphs, Nowhere dense, Excluded minor, Minor-closed, Deletion distance, Elimination distance, Distance
وصف الملف: application/pdf
الإتاحة: https://doi.org/10.17863/CAM.6963Test
https://www.repository.cam.ac.uk/handle/1810/261747Test -
9
المؤلفون: Jannis Bulian, Anuj Dawar
المساهمون: Dawar, Anuj [0000-0003-4014-8248], Apollo - University of Cambridge Repository
مصطلحات موضوعية: FOS: Computer and information sciences, Class (set theory), Computer Science - Logic in Computer Science, Nowhere dense, Dense graph, General Computer Science, Discrete Mathematics (cs.DM), Elimination distance, Nowhere dense set, Parameterized complexity, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Distance measures, Combinatorics, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Excluded minor, Mathematics, Discrete mathematics, Deletion distance, 000 Computer science, knowledge, general works, Fixed-parameter tractable, Distance, Applied Mathematics, Graph theory, Computer Science Applications, Logic in Computer Science (cs.LO), Minor-closed, Computer Science - Computational Complexity, 010201 computation theory & mathematics, Theory of computation, Computer Science, 020201 artificial intelligence & image processing, Edit distance, Sparse graphs, Computer Science(all), Computer Science - Discrete Mathematics
وصف الملف: application/pdf
الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc16f6bfe3e47e0f94a3940c39e1e0a4Test
-
10
المؤلفون: David R. Wood, Naomi Nishimura, Prabhakar Ragde, Catherine McCartin, Matthew Kitching, Vida Dujmović, Sue Whitesides, Giuseppe Liotta, Michael R. Fellows, Frances A. Rosamond
المصدر: Algorithmica. 52:267-292
مصطلحات موضوعية: Fixed parameter tractability, level planarity, General Computer Science, Layered graph drawing, Applied Mathematics, Parameterized complexity, Digraph, Directed graph, Computer Science Applications, Combinatorics, Pathwidth, Graph drawing, Path (graph theory), Time complexity, MathematicsofComputing_DISCRETEMATHEMATICS, Mathematics
الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ab1788da9c674b18c579081efca0a8aTest
https://doi.org/10.1007/s00453-007-9151-1Test
