Maximum-utility Popular Matchings with Bounded Instability: Maximum-utility popular matchings with bounded instability

Authors: Ildikó Schlotter, Ágnes Cseh

Source: ACM Transactions on Computation Theory. 17:1-35

Subject Terms: FOS: Computer and information sciences, Matching models, Discrete Mathematics (cs.DM), stable matching, 0211 other engineering and technologies, Parameterized complexity, tractability and kernelization, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, popular matching, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), master lists, Data Structures and Algorithms (cs.DS), complexity, Computer Science - Discrete Mathematics

File Description: application/xml

Access URL: http://arxiv.org/abs/2205.02189

Computing Hamiltonian Paths with Partial Order Restrictions: Computing Hamiltonian paths with partial order restrictions

Authors: Jesse Beisegel, Fabienne Ratajczak, Robert Scheffler

Source: ACM Transactions on Computation Theory. 17:1-24

Subject Terms: FOS: Computer and information sciences, Eulerian and Hamiltonian graphs, Discrete Mathematics (cs.DM), Parameterized complexity, tractability and kernelization, Computational Complexity (cs.CC), outerplanar graph, partial search order, Computer Science - Computational Complexity, Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, Hamiltonian path, partial order, FOS: Mathematics, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Paths and cycles, TSP-PC, parameterized complexity, Computer Science - Discrete Mathematics

File Description: application/xml

Access URL: http://arxiv.org/abs/2404.16662

Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for Directed Feedback Vertex Set: Wannabe bounded treewidth graphs admit a polynomial kernel for directed feedback vertex set

Authors: Daniel Lokshtanov, Maadapuzhi-Sridharan Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi

Source: ACM Transactions on Computation Theory. 17:1-28

Subject Terms: Graph theory (including graph drawing) in computer science, polynomial kernel, treewidth, Parameterized complexity, tractability and kernelization, important separator, directed feedback vertex set

File Description: application/xml

XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure: XNLP-completeness for parameterized problems on graphs with a linear structure

Authors: Bodlaender, Hans L., Groenland, Carla, Jacob, Hugo, Jaffke, Lars, Lima, Paloma Thome de

Contributors: Hans L. Bodlaender and Carla Groenland and Hugo Jacob and Lars Jaffke and Paloma T. Lima, Sub Algorithms and Complexity, Sub Mathematical Modeling, Algorithms and Complexity, Dell, Holger, Nederlof, Jesper

Source: Leibniz International Proceedings in Informatics
8:1-8:18
Algorithmica
17th International Symposium on Parameterized and Exact Computation (IPEC 2022)
IPEC

Subject Terms: bandwidth, FOS: Computer and information sciences, XP space requirement, Parameterized complexity, tractability and kernelization, Pathwidth, Linear clique-width, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, 7. Clean energy, Bandwidth, Graph algorithms (graph-theoretic aspects), 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), linear mim-width, parameterized complexity, pathwidth, Parameterized complexity, Computer Science - Computational Complexity, Graph theory (including graph drawing) in computer science, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), XNLP, linear width measures, hardness proofs, ddc:004, W-hierarchy, Linear mim-width, Software, linear clique-width

File Description: application/xml; application/pdf

Access URL: http://arxiv.org/abs/2201.13119
https://research-portal.uu.nl/en/publications/df89aedd-7a2e-4055-938c-d21b56bced16
https://doi.org/10.1007/s00453-024-01274-9
https://hdl.handle.net/11250/3041006
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.8
https://dspace.library.uu.nl/handle/1874/425595
https://hdl.handle.net/11250/3170553

Kernelization for feedback vertex set via elimination distance to a forest

Authors: David J.C. Dekker, Bart M.P. Jansen

Source: Discrete Applied Mathematics. 346:192-214

Subject Terms: FOS: Computer and information sciences, F.2.2, G.2.2, elimination distance, 05C85, 68R10, Elimination distance, Analysis of algorithms and problem complexity, Parameterized complexity, tractability and kernelization, feedback vertex set, 0102 computer and information sciences, 01 natural sciences, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, kernelization, Computer Science - Data Structures and Algorithms, Kernelization, Data Structures and Algorithms (cs.DS), Feedback vertex set

File Description: application/xml

Access URL: http://arxiv.org/abs/2206.04387
https://zbmath.org/7804729
https://doi.org/10.1016/j.dam.2023.12.016
https://research.tue.nl/en/publications/b547da42-d430-423f-b097-c1ccc4999279
https://doi.org/10.1016/J.DAM.2023.12.016

Grundy Distinguishes Treewidth from Pathwidth: Grundy distinguishes treewidth from pathwidth

Authors: Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi

Contributors: Hu Ding, Rémy Belmonte and Eun Jung Kim and Michael Lampis and Valia Mitsou and Yota Otachi

Source: SIAM Journal on Discrete Mathematics. 36:1761-1787

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Treewidth, Analysis of algorithms and problem complexity, minimum enclosing ball, Parameterized complexity, tractability and kernelization, Pathwidth, 02 engineering and technology, 0102 computer and information sciences, 01 natural sciences, Coloring of graphs and hypergraphs, high dimensions, Computer Science - Data Structures and Algorithms, treewidth, 0202 electrical engineering, electronic engineering, information engineering, Grundy coloring, Data Structures and Algorithms (cs.DS), Grundy Coloring, shape fitting, Clique-width, outliers, pathwidth, sub-linear time, Graph theory (including graph drawing) in computer science, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Computer Science - Computational Geometry, ddc:004, Recherche opérationnelle, clique-width

File Description: application/xml; application/pdf

Access URL: http://arxiv.org/abs/2004.10090
http://arxiv.org/abs/2008.07425
https://drops.dagstuhl.de/opus/volltexte/2020/12904/
http://ui.adsabs.harvard.edu/abs/2020arXiv200410090D/abstract
https://arxiv.org/abs/2004.10090
https://drops.dagstuhl.de/opus/volltexte/2020/12904/pdf/LIPIcs-ESA-2020-38.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2004.html#abs-2004-10090
https://dblp.uni-trier.de/db/journals/corr/corr2008.html#abs-2008-07425
https://drops.dagstuhl.de/opus/volltexte/2020/12880/pdf/LIPIcs-ESA-2020-14.pdf/
https://drops.dagstuhl.de/opus/volltexte/2020/12880/
https://www.arxiv-vanity.com/papers/2008.07425/
https://arxiv.org/pdf/2008.07425
https://ui.adsabs.harvard.edu/abs/2020arXiv200807425B/abstract
https://arxiv.org/abs/2008.07425
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.38
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.14

Quadratic Vertex Kernel for Split Vertex Deletion: Quadratic vertex kernel for split vertex deletion

Authors: Agrawal, Akanksha, Gupta, Sushmita, Jain, Pallavi, Krithika, R.

Source: Lecture Notes in Computer Science ISBN: 9783030174019
Algorithms and Complexity-11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Algorithms and Complexity

Subject Terms: split graph, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph theory (including graph drawing) in computer science, kernelization, 0202 electrical engineering, electronic engineering, information engineering, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Parameterized complexity, tractability and kernelization, 0102 computer and information sciences, 02 engineering and technology, vertex deletion, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/7226877
https://doi.org/10.1016/j.tcs.2020.06.001
https://rd.springer.com/chapter/10.1007/978-3-030-17402-6_1
http://dblp.uni-trier.de/db/conf/ciac/ciac2019.html#AgrawalG0019
https://research.iitj.ac.in/publication/quadratic-vertex-kernel-for-split-vertex-deletion-1
https://dblp.uni-trier.de/db/conf/ciac/ciac2019.html#AgrawalG0019
https://link.springer.com/10.1007/978-3-030-17402-6_1
https://link.springer.com/chapter/10.1007/978-3-030-17402-6_1
https://www.sciencedirect.com/science/article/abs/pii/S0304397520303352
https://dblp.uni-trier.de/db/journals/tcs/tcs833.html#AgrawalGJK20

Vertex deletion on split graphs: Beyond 4-hitting set: Vertex deletion on split graphs: beyond 4-hitting set

Authors: Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot

Source: Lecture Notes in Computer Science ISBN: 9783030174019

Subject Terms: vertex deletion problems, parameterized algorithms, Graph theory (including graph drawing) in computer science, 4. Education, split graphs, kernelization, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Parameterized complexity, tractability and kernelization, 0102 computer and information sciences, approximation algorithms, 01 natural sciences, 7. Clean energy, Approximation algorithms

File Description: application/xml

Access URL: https://zbmath.org/7264843
https://doi.org/10.1016/j.tcs.2020.08.028
https://www.sciencedirect.com/science/article/pii/S030439752030493X
https://rd.springer.com/chapter/10.1007/978-3-030-17402-6_14
https://research.iitj.ac.in/publication/vertex-deletion-on-split-graphs-beyond-4-hitting-set
https://doi.org/10.1016/j.tcs.2020.08.028
https://dblp.uni-trier.de/db/journals/tcs/tcs845.html#ChoudharyJKS20
https://research.iitj.ac.in/publication/vertex-deletion-on-split-graphs-beyond-4-hitting-set-1
https://link.springer.com/chapter/10.1007/978-3-030-17402-6_14
https://dblp.uni-trier.de/db/conf/ciac/ciac2019.html#Choudhary0KS19
http://dblp.uni-trier.de/db/conf/ciac/ciac2019.html#Choudhary0KS19

Domination chain: Characterisation, classical complexity, parameterised complexity and approximability: Domination chain: characterisation, classical complexity, parameterised complexity and approximability

Authors: Bazgan, Cristina, Brankovic, Ljiljana, Casel, Katrin, Fernau, Henning

Contributors: The University of Newcastle. Faculty of Engineering & Built Environment, School of Elect Engineering and Computer Science

Source: Discrete Applied Mathematics. 280:23-42

Subject Terms: Approximation complexity, 0211 other engineering and technologies, Parameterized complexity, tractability and kernelization, classical complexity, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences, Classical complexity, Planar graphs, geometric and topological aspects of graph theory, Domination chain, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), approximation complexity, Graph algorithms (graph-theoretic aspects), parameterised complexity, Modèles mathématiques. Algorithmes, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Parameterised complexity, domination chain, special graph classes, Special graph classes

File Description: application/xml; application/pdf

Access URL: https://basepub.dauphine.psl.eu/bitstream/123456789/22260/2/Domination-chain.pdf
https://zbmath.org/7201702
https://doi.org/10.1016/j.dam.2019.10.005

A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter: A randomized polynomial kernelization for vertex cover with a smaller parameter

Authors: Kratsch, Stefan

Contributors: Stefan Kratsch

Source: SIAM Journal on Discrete Mathematics. 32:1806-1839

Subject Terms: FOS: Computer and information sciences, Randomized algorithms, 0211 other engineering and technologies, Parameterized complexity, tractability and kernelization, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences, vertex cover, Vertex cover, polynomial kernelization, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph algorithms (graph-theoretic aspects), kernelization, Computer Science - Data Structures and Algorithms, Analysis of algorithms, Data Structures and Algorithms (cs.DS), ddc:004, parameterized complexity

File Description: application/xml; application/pdf

Access URL: https://drops.dagstuhl.de/opus/volltexte/2016/6406/pdf/LIPIcs-ESA-2016-59.pdf
http://arxiv.org/abs/1611.06795
https://zbmath.org/6911239
https://doi.org/10.1137/16m1104585
https://drops.dagstuhl.de/opus/volltexte/2016/6406/
https://dblp.uni-trier.de/db/conf/esa/esa2016.html#Kratsch16
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.59

Randomized complexity of parametric integration and the role of adaption I. Finite dimensional case: Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case

Authors: Heinrich, Stefan

Source: Journal of Complexity. 81:101821

Subject Terms: algorithm, Analysis of algorithms and problem complexity, adaptive, Parameterized complexity, tractability and kernelization, Communication complexity, information complexity, Numerical Analysis (math.NA), General theory of numerical analysis in abstract spaces, Complexity and performance of numerical algorithms, information-based complexity, Algorithms for approximation of functions, randomized, vector-valued mean, FOS: Mathematics, nonadaptive, Mathematics - Numerical Analysis

File Description: application/xml

Access URL: http://arxiv.org/abs/2306.13471

Tractability of König edge deletion problems

Authors: Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali

Source: Theoretical Computer Science. 796:207-215

Subject Terms: König edge deletion, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0211 other engineering and technologies, Parameterized complexity, tractability and kernelization, 68Q25, 0102 computer and information sciences, 02 engineering and technology, W-hardness, 01 natural sciences, vertex cover, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), König graphs, Computer Science - Data Structures and Algorithms, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Data Structures and Algorithms (cs.DS), parameterized complexity, Computer Science - Discrete Mathematics

File Description: application/xml

Access URL: http://arxiv.org/pdf/1811.04560
http://arxiv.org/abs/1811.04560
https://dblp.uni-trier.de/db/journals/corr/corr1811.html#abs-1811-04560
https://www.sciencedirect.com/science/article/abs/pii/S0304397519305559

Deletion to scattered graph classes I - Case of finite number of graph classes: Deletion to scattered graph classes. I: Case of finite number of graph classes

Authors: Ashwin Jacob, Jari J.H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman

Source: Journal of Computer and System Sciences. 138:103460

Subject Terms: FOS: Computer and information sciences, Graph theory (including graph drawing) in computer science, fixed-parameter tractability, Computer Science - Data Structures and Algorithms, important separators, Parameterized complexity, tractability and kernelization, scattered graph classes, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences, parameterized complexity

File Description: application/xml

Access URL: http://arxiv.org/abs/2105.04660

Parameterizing Path Partitions: Parameterizing path partitions

Authors: Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, K. N. Rajath Rao

Contributors: Foucaud, Florent

Source: Lecture Notes in Computer Science ISBN: 9783031304477

Subject Terms: FOS: Computer and information sciences, neighborhood diversity, Vertex Cover Parameterization, Parameterized complexity, tractability and kernelization, vertex cover parameterization, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 01 natural sciences, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Graph theory (including graph drawing) in computer science, Computer Science - Data Structures and Algorithms, NP-hardness, Data Structures and Algorithms (cs.DS), Directed Neighborhood Diversity, path partitions, Path Partitions NP-hardness Parameterized Complexity Neighborhood Diversity Directed Neighborhood Diversity Vertex Cover Parameterization, Path Partitions, Neighborhood Diversity, directed neighborhood diversity, Parameterized Complexity, parameterized complexity

File Description: application/pdf; application/xml

Access URL: http://arxiv.org/abs/2212.11653
https://hal.science/hal-04085831v3
https://doi.org/10.1007/978-3-031-30448-4_14
https://hal.science/hal-04085831v3/document
https://zbmath.org/7967951
https://doi.org/10.1016/j.tcs.2024.115029
https://hal.science/hal-04852374v1
https://hal.science/hal-04852374v1/document
https://doi.org/10.1016/j.tcs.2024.115029