Hard variants of stable marriage
Theoretical Computer Science
The stable roommates problem with ties
Journal of Algorithms
On Approximability of the Independent/Connected Edge Dominating Set Problems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Approximability results for stable marriage problems with ties
Theoretical Computer Science
Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Inapproximability of the kidney exchange problem
Information Processing Letters
Approximability of the capacitated b-edge dominating set problem
Theoretical Computer Science
Approximation algorithms for partially covering with edges
Theoretical Computer Science
The stable marriage problem with master preference lists
Discrete Applied Mathematics
Improved approximation bounds for edge dominating set in dense graphs
Theoretical Computer Science
A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem
Approximation and Online Algorithms
Minimum maximal matching is NP-hard in regular bipartite graphs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem
Information Processing Letters
Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
Information Processing Letters
Approximating edge dominating set in dense graphs
Theoretical Computer Science
“Almost stable” matchings in the roommates problem
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Small independent edge dominating sets in graphs of maximum degree three
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Pareto optimality in house allocation problems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Linear time algorithms for generalized edge dominating set problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Pareto optimality in house allocation problems
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
EDGE DOMINATING SET: efficient enumeration-based exact algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Improved approximation bounds for edge dominating set in dense graphs
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Generalizing the induced matching by edge capacity constraints
Discrete Optimization
Stable marriage and roommate problems with individual-based stability
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Hi-index | 0.01 |