PDF) Recognizing when a preference system is close to admitting a master list
A pedagógiai szakmai szolgáltató tanfolyamai 2012/2013 AKKREDITÁLT TANFOLYAMOK - PDF Free Download
Utánfutó kölcsönző... - Utánfutó kölcsönző Biatorbágy | Facebook
Parameterized graph cleaning problems - ScienceDirect
Conference & Journal papers
PhD Thesis
PDF) Stable Matching with Uncertain Linear Preferences
Parameterized Complexity of Eulerian Deletion Problems
Untitled
Parameterized Approximation | SpringerLink
Interval Deletion Is Fixed-Parameter Tractable | ACM Transactions on Algorithms
LNCS 8635 - Mathematical Foundations of Computer Science 2014
Algorithmic Analysis of Priority-Based Bin Packing | SpringerLink
Obtaining a Planar Graph by Vertex Deletion
Original version
Severely
Literatur
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms : A Near-Optimal Planarization Algorithm
Katarína CECHLÁROVÁ | Pavol Jozef Šafárik University in Košice, Košice | Institute of Mathematics | Research profile
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs | SpringerLink
LENSLESS FOURIER TRANSFORM HOLOGRAPHY WITH SOFT X-RAYS A DISSERTATION SUBMITTED TO THE DEPARTMENT OF APPLIED PHYSICS AND THE COM
Szép Ügyvédi Iroda | Budapest
LNCS 7357 - Algorithm Theory – SWAT 2012
PDF) On the Computation of Fully Proportional Representation | Arkadii Slinko - Academia.edu
Severely
