:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Blažej, Václav, Dębski, Michał, Lonc, Zbigniew, Piecyk, Marta, Rzążewski, Paweł
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics Artificial Intelligence
Online Access:	https://arxiv.org/abs/2508.06343
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

List coloring ordered graphs with forbidden induced subgraphs
by: Piecyk, Marta, et al.
Published: (2025)

Bears with Hats and Independence Polynomials
by: Blažej, Václav, et al.
Published: (2021)

Tree-independence number of $P_5$-free graphs with no large bicliques
by: Blažej, Václav, et al.
Published: (2026)

Graph Reconstruction with Connectivity Queries
by: Kluk, Kacper, et al.
Published: (2024)

Complexity Aspects of Homomorphisms of Ordered Graphs
by: Čertík, Michal, et al.
Published: (2025)

On Computational Aspects of Cores of Ordered Graphs
by: Čertík, Michal, et al.
Published: (2025)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)

Polynomial-time recognition and maximum independent set in Burling graphs
by: Rzążewski, Paweł, et al.
Published: (2024)

Pushing the Frontier on Approximate EFX Allocations
by: Amanatidis, Georgios, et al.
Published: (2024)

Induced matching treewidth and tree-independence number, revisited
by: Alon, Noga, et al.
Published: (2025)

Transition Graph Properties of Target Class Classification
by: Aslanyan, Levon, et al.
Published: (2024)

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

On Computational Aspects of Ordered Matching Problems
by: Čertík, Michal, et al.
Published: (2025)

Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)

On coarse tree decompositions and coarse balanced separators
by: Abrishami, Tara, et al.
Published: (2025)

Detection of decision-making manipulation in the pairwise comparisons method
by: Strada, Michał, et al.
Published: (2024)

Clique-width and induced topological minors
by: Bieliński, Paweł Rafał, et al.
Published: (2026)

An $11/6$-Approximation Algorithm for Vertex Cover on String Graphs
by: Bonnet, Édouard, et al.
Published: (2024)

HyColor: An Efficient Heuristic Algorithm for Graph Coloring
by: Zhu, Enqiang, et al.
Published: (2025)

Are Graph Neural Networks Optimal Approximation Algorithms?
by: Yau, Morris, et al.
Published: (2023)

Constant congestion brambles in directed graphs
by: Masařík, Tomáš, et al.
Published: (2021)

Max Weight Independent Set in sparse graphs with no long claws
by: Abrishami, Tara, et al.
Published: (2023)

ReLU Networks for Exact Generation of Similar Graphs
by: Ghafoor, Mamoona, et al.
Published: (2026)

Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search
by: Mehrabian, Abbas, et al.
Published: (2023)

A Multi-Objective Genetic Algorithm for Healthcare Workforce Scheduling
by: Patel, Vipul, et al.
Published: (2025)

Revisiting FastMap: New Applications
by: Li, Ang
Published: (2025)

Degree-Based Logical Adjacency Checking (DBLAC): A Novel Heuristic for Vertex Coloring
by: Verma, Prashant
Published: (2025)

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes
by: Asadi, Ali, et al.
Published: (2025)

GDBA Revisited: Unleashing the Power of Guided Local Search for Distributed Constraint Optimization
by: Deng, Yanchen, et al.
Published: (2025)

A Fast GRASP Metaheuristic for the Trigger Arc TSP with MIP-Based Construction and Multi-Neighborhood Local Search
by: Soler, Joan Salvà, et al.
Published: (2025)

A mathematical model for simultaneous personnel shift planning and unrelated parallel machine scheduling
by: Khadivi, Maziyar, et al.
Published: (2024)

Feature-Guided Metaheuristic with Diversity Management for Solving the Capacitated Vehicle Routing Problem
by: Herdianto, Bachtiar, et al.
Published: (2024)

Manipulation of individual judgments in the quantitative pairwise comparisons method
by: Strada, M., et al.
Published: (2022)

A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows
by: Lucci, Mauro, et al.
Published: (2021)

Mean-based incomplete pairwise comparisons method with the reference values
by: Kułakowski, Konrad, et al.
Published: (2022)

My part is bigger than yours -- assessment within a group of peers
by: Kułakowski, Konrad, et al.
Published: (2024)

Logic-Constrained Shortest Paths for Flight Planning
by: Euler, Ricardo, et al.
Published: (2024)

Fair Clustering for Data Summarization: Improved Approximation Algorithms and Complexity Insights
by: Gadekar, Ameet, et al.
Published: (2024)

A Memetic Algorithm To Find a Hamiltonian Cycle in a Hamiltonian Graph
by: Ali, Sarwan, et al.
Published: (2024)

A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates
by: Weiss, Eyal, et al.
Published: (2022)