Cover Image

The Parameterized Complexity of Coloring Mixed Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lauerbach, Antonio, Junosza-Szaniawski, Konstanty, Sieper, Marie Diana, Wolff, Alexander
Format:	Preprint
Published:	2026
Subjects:	Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Modelling Network Resilience: The Complexity of Some Graph Division Games
by: Gutowski, Grzegorz, et al.
Published: (2026)

Eliminating Majority Illusions
by: Fioravantes, Foivos, et al.
Published: (2025)

The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem
by: Lauerbach, Antonio, et al.
Published: (2024)

The Parameterized Complexity of Computing the Linear Vertex Arboricity
by: Erhardt, Alexander, et al.
Published: (2025)

Coloring and Recognizing Directed Interval Graphs
by: Gutowski, Grzegorz, et al.
Published: (2023)

On the Parameterized Complexity of Odd Coloring
by: Bhyravarapu, Sriram, et al.
Published: (2025)

On the Parameterized Complexity of Semitotal Domination on Graph Classes
by: Retschmeier, Lukas
Published: (2025)

The Parameterized Complexity of Geometric 1-Planarity
by: Firbas, Alexander
Published: (2026)

The Complexity of Drawing Graphs on Few Lines and Few Planes
by: Chaplick, Steven, et al.
Published: (2016)

Hexasort -- The Complexity of Stacking Colors on Graphs
by: Klocker, Linus, et al.
Published: (2026)

Online Coloring of Short Intervals
by: Chybowska-Sokół, Joanna, et al.
Published: (2018)

Parameterized Complexity of the Star Decomposition Problem
by: Hajebi, Sahab, et al.
Published: (2024)

The Parameterized Complexity of Vertex-Coloring Edge-Weighting
by: Aute, Shubhada, et al.
Published: (2026)

Parameterized Complexity of Fair Many-to-One Matchings
by: Javadi, Ramin, et al.
Published: (2024)

A Parameterized-Complexity Framework for Finding Local Optima
by: Ganian, Robert, et al.
Published: (2026)

Second-Order Parameterizations for the Complexity Theory of Integrable Functions
by: Bacho, Aras, et al.
Published: (2025)

Parameterized Complexity of Segment Routing
by: Bazgan, Cristina, et al.
Published: (2025)

A Parameterized Study of Secluded Structures in Directed Graphs
by: Schmidt, Jonas, et al.
Published: (2025)

The Parameterized Complexity of Terminal Monitoring Set
by: Aravind, N. R., et al.
Published: (2024)

Parameterized Complexity of Vehicle Routing
by: Döring, Michelle, et al.
Published: (2025)

Parameterized Complexity of Caching in Networks
by: Ganian, Robert, et al.
Published: (2024)

Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity Study
by: Komusiewicz, Christian, et al.
Published: (2024)

Parameterized Complexity Of Representing Models Of MSO Formulas
by: Kučera, Petr, et al.
Published: (2026)

On the Parameterized Complexity of Min-Sum-Radii
by: Kumar, Pankaj, et al.
Published: (2026)

Recognizing 2-Layer and Outer $k$-Planar Graphs
by: Kobayashi, Yasuaki, et al.
Published: (2024)

The Parameterized Landscape of Labeled Graph Contractions
by: Lafond, Manuel, et al.
Published: (2025)

Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach
by: Eriksson, Leif, et al.
Published: (2026)

Explaining Decisions in ML Models: a Parameterized Complexity Analysis
by: Ordyniak, Sebastian, et al.
Published: (2024)

Generalized Graph Packing Problems Parameterized by Treewidth
by: Esmer, Barış Can, et al.
Published: (2025)

Parameterized Algorithms for Editing to Uniform Cluster Graph
by: Gaikwad, Ajinkya, et al.
Published: (2024)

Constrained and Ordered Level Planarity Parameterized by the Number of Levels
by: Blažej, Václav, et al.
Published: (2024)

Complexity Thresholds for the Constrained Colored Token Swapping Problem
by: Bilò, Davide, et al.
Published: (2026)

The Computational Complexity of Factored Graphs
by: Gupta, Shreya, et al.
Published: (2024)

Computational Social Choice: Parameterized Complexity and Challenges
by: Chen, Jiehua, et al.
Published: (2024)

Baby PIH: Parameterized Inapproximability of Min CSP
by: Guruswami, Venkatesan, et al.
Published: (2023)

Parameterized Local Search for Max $c$-Cut
by: Garvardt, Jaroslav, et al.
Published: (2024)

On the Complexity of Vertex-Splitting Into an Interval Graph
by: Abu-Khzam, Faisal N., et al.
Published: (2026)

On the Complexity of Problems on Tree-structured Graphs
by: Bodlaender, Hans L., et al.
Published: (2022)

The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
by: Bodlaender, Hans L., et al.
Published: (2026)

Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
by: Bai, Tian, et al.
Published: (2026)