Author of the publication

Vertex Cover Problem Parameterized Above and Below Tight Bounds.

, , , and . Theory Comput. Syst., 48 (2): 402-410 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems., , and . WAOA, volume 4368 of Lecture Notes in Computer Science, page 214-225. Springer, (2006)Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems.. Electron. Notes Discret. Math., (2009)Systems of Linear Equations over F2 and Problems Parameterized above Average., , , , and . SWAT, volume 6139 of Lecture Notes in Computer Science, page 164-175. Springer, (2010)A memetic algorithm for the generalized traveling salesman problem., and . Nat. Comput., 9 (1): 47-60 (2010)Algorithms for the workflow satisfiability problem engineered for counting constraints., , , , and . CoRR, (2015)Note on Existence and Non-Existence of Large Subsets of Binary Vectors with Similar Distances, and . CoRR, (2012)Note on Max Lin-2 above Average, , and . CoRR, (2009)Pattern-Based Plan Construction for the Workflow Satisfiability Problem., , , and . CoRR, (2013)Spanning Directed Trees with Many Leaves., , , , and . SIAM J. Discret. Math., 23 (1): 466-476 (2009)Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming., , , , and . IPEC, volume 6478 of Lecture Notes in Computer Science, page 158-169. Springer, (2010)