The following pages link to Dimitrios Michail (Q270031):
Displaying 19 items.
- Fair matchings and related problems (Q270032) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- Bounded unpopularity matchings (Q644804) (← links)
- Cycle bases of graphs and sampled manifolds (Q733440) (← links)
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (Q1006382) (← links)
- Reducing rank-maximal to maximum weight matching (Q2465632) (← links)
- Minimum cycle bases (Q2930281) (← links)
- Rank-maximal matchings (Q2944532) (← links)
- Strongly stable matchings in time <i>O</i> ( <i>nm</i> ) and extension to the hospitals-residents problem (Q2944552) (← links)
- Fair Matchings and Related Problems (Q2963925) (← links)
- (Q3507772) (← links)
- Bounded Unpopularity Matchings (Q3512453) (← links)
- New Approximation Algorithms for Minimum Cycle Bases of Graphs (Q3590960) (← links)
- JGraphT—A Java Library for Graph Data Structures and Algorithms (Q5132324) (← links)
- STACS 2004 (Q5309702) (← links)
- Automata, Languages and Programming (Q5466519) (← links)
- (Q5501244) (← links)
- Experimental and Efficient Algorithms (Q5710059) (← links)
