LNCS 7357 - Algorithm Theory – SWAT 2012
PDF) On the Computation of Fully Proportional Representation | Arkadii Slinko - Academia.edu
Utánfutó kölcsönző... - Utánfutó kölcsönző Biatorbágy | Facebook
Plane augmentation of plane graphs to meet parity constraints - ScienceDirect
PDF) Stable Matching with Uncertain Linear Preferences
Literatur
Untitled
Conference & Journal papers
2006 Képek a kóruséletről
Obtaining a Planar Graph by Vertex Deletion
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms : A Near-Optimal Planarization Algorithm
Handbook of Computational Social Choice
Katarína CECHLÁROVÁ | Pavol Jozef Šafárik University in Košice, Košice | Institute of Mathematics | Research profile
Reduction rule (R 4) for deg(v) = 2. (R 5) If G has a k-vertex cover... | Download Scientific Diagram
Parameterized Complexity of Eulerian Deletion Problems
A pedagógiai szakmai szolgáltató tanfolyamai 2012/2013 AKKREDITÁLT TANFOLYAMOK - PDF Free Download
115th Commencement, Spring
PhD Thesis
PDF) Recognizing when a preference system is close to admitting a master list
Algorithmic Analysis of Priority-Based Bin Packing | SpringerLink
Severely
Original version
Backdoors to Satisfaction | SpringerLink
