Backdoors to Satisfaction | SpringerLink
115th Commencement, Spring
Szép Ügyvédi Iroda | Budapest
CS348b Final Project: Ray-tracing Interference and Diffraction
Reduction rule (R 4) for deg(v) = 2. (R 5) If G has a k-vertex cover... | Download Scientific Diagram
Interval Deletion Is Fixed-Parameter Tractable | ACM Transactions on Algorithms
LNCS 8635 - Mathematical Foundations of Computer Science 2014
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms : A Near-Optimal Planarization Algorithm
PDF) Recognizing when a preference system is close to admitting a master list
PDF) On the Computation of Fully Proportional Representation | Arkadii Slinko - Academia.edu
Obtaining a Planar Graph by Vertex Deletion
Parameterized Approximation | SpringerLink
2006 Képek a kóruséletről
Katarína CECHLÁROVÁ | Pavol Jozef Šafárik University in Košice, Košice | Institute of Mathematics | Research profile
Summer School on Matching Problems, Markets and Mechanisms David Manlove. - ppt download
Parameterized Graph Cleaning Problems*
Severely
Literatur
PDF) Stable Matching with Uncertain Linear Preferences
Severely
Handbook of Computational Social Choice
