Parameterized Graph Cleaning Problems*
Original version
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms : A Near-Optimal Planarization Algorithm
CS348b Final Project: Ray-tracing Interference and Diffraction
Interval Deletion Is Fixed-Parameter Tractable | ACM Transactions on Algorithms
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
Fixing the GAP: The role of RhoGAPs in cancer - ScienceDirect
Algorithmic Analysis of Priority-Based Bin Packing | SpringerLink
Szép Ügyvédi Iroda | Budapest
Conference & Journal papers
PhD Thesis
Obtaining a Planar Graph by Vertex Deletion
LENSLESS FOURIER TRANSFORM HOLOGRAPHY WITH SOFT X-RAYS A DISSERTATION SUBMITTED TO THE DEPARTMENT OF APPLIED PHYSICS AND THE COM
PDF) Stable Matching with Uncertain Linear Preferences
Local envy-freeness in house allocation problems | SpringerLink
PDF) Recognizing when a preference system is close to admitting a master list
Parameterized Graph Cleaning Problems*
Utánfutó kölcsönző... - Utánfutó kölcsönző Biatorbágy | Facebook
Handbook of Computational Social Choice
Plane augmentation of plane graphs to meet parity constraints - ScienceDirect
Severely
LNCS 7357 - Algorithm Theory – SWAT 2012
Summer School on Matching Problems, Markets and Mechanisms David Manlove. - ppt download
