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
Handbook of Computational Social Choice
Summer School on Matching Problems, Markets and Mechanisms David Manlove. - ppt download
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms : A Near-Optimal Planarization Algorithm
Parameterized Approximation | SpringerLink
Parameterized graph cleaning problems - ScienceDirect
Severely
Algorithmic Analysis of Priority-Based Bin Packing | SpringerLink
Obtaining a Planar Graph by Vertex Deletion
Plane augmentation of plane graphs to meet parity constraints - ScienceDirect
PhD Thesis
LENSLESS FOURIER TRANSFORM HOLOGRAPHY WITH SOFT X-RAYS A DISSERTATION SUBMITTED TO THE DEPARTMENT OF APPLIED PHYSICS AND THE COM
LNCS 7357 - Algorithm Theory – SWAT 2012
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs | SpringerLink
The evolution of rectangular bin packing problem — A review of research topics, applications, and cited papers
PDF) Stable Matching with Uncertain Linear Preferences
Parameterized Complexity of Eulerian Deletion Problems
Backdoors to Satisfaction | SpringerLink
Dagstuhl Reports, Volume 11, Issue 6, July 2021
Reduction rule (R 4) for deg(v) = 2. (R 5) If G has a k-vertex cover... | Download Scientific Diagram
Severely
Parameterized Graph Cleaning Problems*
115th Commencement, Spring
Katarína CECHLÁROVÁ | Pavol Jozef Šafárik University in Košice, Košice | Institute of Mathematics | Research profile
LNCS 8635 - Mathematical Foundations of Computer Science 2014
