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

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

المؤلفون: Olivier Boes, Leo van Iersel, Leen Stougie, Steven Kelk, Georgios Stamoulis

المساهمون: Econometrics and Operations Research, Tinbergen Institute, Amsterdam Business Research Institute, DKE Scientific staff, RS: FSE DACS BMI, RS: FSE DACS NSO, RS: FSE DACS, Delft Institute of Applied Mathematics (TWA), Faculty of Electrical Engineering, Mathematics and Computer Science [Delft] (EEMCS)-Delft University of Technology (TU Delft), Department of data science and Knowledge Engineering [Maastricht], Maastricht University [Maastricht], Vrije Universiteit Amsterdam [Amsterdam] (VU), Equipe de recherche européenne en algorithmique et biologie formelle et expérimentale (ERABLE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

المصدر: van Iersel, L, Kelk, S, Stamoulis, G, Stougie, L & Boes, O 2018, ' On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems ', Algorithmica, vol. 80, no. 11, pp. 2993-3022 . https://doi.org/10.1007/s00453-017-0366-5Test
Algorithmica, 80, 2993-3022
Algorithmica
Algorithmica, 80(11), 2993-3022. Springer New York
CoRR abs
Algorithmica, 80(11), 2993-3022. Springer Verlag
Algorithmica, 2018, 64 (4), pp.621-637. ⟨10.1093/sysbio/syv020⟩

مصطلحات موضوعية: 0301 basic medicine, FOS: Computer and information sciences, General Computer Science, 0102 computer and information sciences, 01 natural sciences, Article, MAXIMUM AGREEMENT FOREST, Set (abstract data type), Combinatorics, EVENTS, APX-hardness, 03 medical and health sciences, Phylogenetic networks, Computer Science::Discrete Mathematics, Computer Science - Data Structures and Algorithms, Quantitative Biology::Populations and Evolution, Fixedparametertractability, Data Structures and Algorithms (cs.DS), Mathematics, Discrete mathematics, Binary tree, Phylogenetic tree, FIXED-PARAMETER ALGORITHMS, Applied Mathematics, Phylogenetic network, Binary trees, Computer Science Applications, NP-completeness, 030104 developmental biology, 010201 computation theory & mathematics, Binarytrees, Kernelization, Theory of computation, Fixed parameter tractability, TREES, Tree (set theory), Split, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], HYBRIDIZATION NUMBER, APPROXIMATION

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

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::28ce127bae00be2581db634e16338bf3Test
https://doi.org/10.1007/s00453-017-0366-5Test

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

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

المؤلفون: Mnich, Matthias, Schlotter, Ildikó

المصدر: Algorithmica
Algorithmica (2020)

مصطلحات موضوعية: Lower quotas, General Computer Science, Applied Mathematics, 05 social sciences, 68R10, 050301 education, 0102 computer and information sciences, 91B68, Fixed-parameter algorithms, 01 natural sciences, Article, Computer Science Applications, 010201 computation theory & mathematics, ddc:510, 0503 education, Mathematik [510], Stable marriage

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

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b2ec4a4a6856b88d68123469e5e96cfTest
https://pubmed.ncbi.nlm.nih.gov/32214574Test

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

المؤلفون: Jannis Bulian, Anuj Dawar

المساهمون: Dawar, Anuj [0000-0003-4014-8248], Apollo - University of Cambridge Repository

المصدر: Parameterized and Exact Computation ISBN: 9783319135236
IPEC

مصطلحات موضوعية: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), General Computer Science, Tree-depth, G.2.2, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Distance-regular graph, Graph canonization, Graph, Bounded degree, Combinatorics, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Graph homomorphism, Isomorphism, 0101 mathematics, Graph isomorphism, Graph automorphism, Graph property, Complement graph, Mathematics, F.2.2, Discrete mathematics, Canonization, Fixed-parameter tractable, Complexity theory, Applied Mathematics, 010102 general mathematics, Voltage graph, Quartic graph, Computer Science Applications, Graph theory, Computer Science - Computational Complexity, Parameterized complexity, 010201 computation theory & mathematics, Regular graph, Null graph, Computer Science - Discrete Mathematics, MathematicsofComputing_DISCRETEMATHEMATICS, Computer Science(all)

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

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::851d8fa631461a9da1ec4accb37adc9dTest