Parameterized Graph Cleaning Problems*
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
Parameterized Graph Cleaning Problems*
115th Commencement, Spring
A pedagógiai szakmai szolgáltató tanfolyamai 2012/2013 AKKREDITÁLT TANFOLYAMOK - PDF Free Download
Original version
Backdoors to Satisfaction | SpringerLink
Untitled
LNCS 7357 - Algorithm Theory – SWAT 2012
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms : A Near-Optimal Planarization Algorithm
PDF) Stable Matching with Uncertain Linear Preferences
Parameterized Complexity of Eulerian Deletion Problems
Szép Ügyvédi Iroda | Budapest
Severely
LNCS 8635 - Mathematical Foundations of Computer Science 2014
Interval Deletion Is Fixed-Parameter Tractable | ACM Transactions on Algorithms
Algorithmic Analysis of Priority-Based Bin Packing | SpringerLink
Handbook of Computational Social Choice
PhD Thesis
Severely
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs | SpringerLink
PDF) Recognizing when a preference system is close to admitting a master list
Conference & Journal papers
Reduction rule (R 4) for deg(v) = 2. (R 5) If G has a k-vertex cover... | Download Scientific Diagram
