Parameterized Complexity of Eulerian Deletion Problems
PDF) On the Computation of Fully Proportional Representation | Arkadii Slinko - Academia.edu
PDF) Stable Matching with Uncertain Linear Preferences
Untitled
LNCS 7357 - Algorithm Theory – SWAT 2012
Severely
Fixing the GAP: The role of RhoGAPs in cancer - ScienceDirect
115th Commencement, Spring
Plane augmentation of plane graphs to meet parity constraints - ScienceDirect
Katarína CECHLÁROVÁ | Pavol Jozef Šafárik University in Košice, Košice | Institute of Mathematics | Research profile
Conference & Journal papers
Local envy-freeness in house allocation problems | SpringerLink
Original version
Backdoors to Satisfaction | SpringerLink
Szép Ügyvédi Iroda | Budapest
Parameterized Approximation | SpringerLink
LNCS 8635 - Mathematical Foundations of Computer Science 2014
Handbook of Computational Social Choice
Literatur
LENSLESS FOURIER TRANSFORM HOLOGRAPHY WITH SOFT X-RAYS A DISSERTATION SUBMITTED TO THE DEPARTMENT OF APPLIED PHYSICS AND THE COM
PhD Thesis
The evolution of rectangular bin packing problem — A review of research topics, applications, and cited papers
Dagstuhl Reports, Volume 11, Issue 6, July 2021
Parameterized Graph Cleaning Problems*
Parameterized graph cleaning problems - ScienceDirect
PDF) Recognizing when a preference system is close to admitting a master list
PDF) Recognizing when a preference system is close to admitting a master list
Interval Deletion Is Fixed-Parameter Tractable | ACM Transactions on Algorithms
