In Candidate Interval and Voter Interval domains, Pareto optimal committees admit a simple dominance characterization, satisfy monotonicity, allow direct reconfiguration, and support polynomial algorithms for proportionality and counting.
Distance Coloring
5 Pith papers cite this work, alongside 181 external citations. Polarity classification is still indexing.
5
Pith papers citing it
181
external citations · OpenAlex
representative citing papers
Establishes PSPACE-completeness of (d,k)-Coloring Reconfiguration for d>=2 on multiple restricted graph classes and a quadratic-time algorithm on paths.
The paper defines FO Cost-Value Decision for token-sliding discovery and proves FPT and W[1]-hardness results for Partial Vertex Cover Discovery across various graph classes.
Forests, trees, and matchings can always be reconfigured on the torus and higher-genus orientable surfaces by rerouting one edge at a time while maintaining crossing-free embeddings.
Empirical classification of search landscapes for two combinatorial problems across graph classes and two neighborhoods.
citing papers explorer
-
Pareto Optimality in Approval-Based Multiwinner Voting
In Candidate Interval and Voter Interval domains, Pareto optimal committees admit a simple dominance characterization, satisfy monotonicity, allow direct reconfiguration, and support polynomial algorithms for proportionality and counting.
-
Distance Recoloring
Establishes PSPACE-completeness of (d,k)-Coloring Reconfiguration for d>=2 on multiple restricted graph classes and a quadratic-time algorithm on paths.
-
FO Value Discovery and Partial Vertex Cover Discovery
The paper defines FO Cost-Value Decision for token-sliding discovery and proves FPT and W[1]-hardness results for Partial Vertex Cover Discovery across various graph classes.
-
Rerouting Curves on Surfaces
Forests, trees, and matchings can always be reconfigured on the torus and higher-genus orientable surfaces by rerouting one edge at a time while maintaining crossing-free embeddings.
-
Combinatorial Landscape Analysis for Dominating Set and Vertex Coloring
Empirical classification of search landscapes for two combinatorial problems across graph classes and two neighborhoods.