Your search returned the following 19 documents:
-
Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
Danny Hermelin, Romeo Rizzi, and Stephane Vialette
In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, 2012, 465-474
-
Optimization Problems in Dotted Interval Graphs
Danny Hermelin, Julian Mestre, and Dror Rawitz
In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, Jerusalem, Israel, 2012, 46-56
-
Parameterized complexity of induced H-matching on claw-free graphs
Danny Hermelin, Matthias Mnich, and Erik Jan van Leeuwen
In: Algorithms - ESA 2012 : 20th Annual European Symposium, Ljubljana, Slovenia, 2012, 624-635
-
Weak compositions and their applications to polynomial lower bounds for kernelization
Danny Hermelin and Xi Wu
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), Tokyo, Japan, 2012, 104-113
-
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
Michael R. Fellows, Danny Hermelin, and Fraces A. Rosamond
Algorithmica 64 (1): 3-18, 2012
-
Average Case Parameterized Complexity
Nikolaos Fountoulakis, Tobias Friedrich, and Danny Hermelin
. Note: Submitted
-
Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable
Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, and Frances A. Rosamond
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), Barcelona, Spain, 2011, 522-527
-
Distance Oracles for Vertex-Labeled Graphs
Danny Hermelin, Avivit Levy, Oren Weimann, and Raphael Yuster
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, 2011, 490-501
-
Domination When the Stars Are Out
Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, and Gerhard J. Woeginger
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, 2011, 462-473
-
Haplotype Inference Constrained by Plausible Haplotype Data
Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, and Liat Rozenberg
IEEE/ACM Transactions on Computational Biology and Bioinformatics 8 (6): 1692-1699, 2011
-
Minimum vertex cover in rectangle graphs
Reuven Bar-Yehuda, Danny Hermelin, and Dror Rawitz
Computational Geometry 44 (6-7): 356-364, 2011
-
Optimization problems in multiple subtree graphs
Danny Hermelin and Dror Rawitz
Discrete Applied Mathematics 159 (7): 588-594, 2011
-
Parameterized Two-Player Nash Equilibrium
Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, and Magnus Wahlström
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, 2011, 215-226
-
Treewidth governs the complexity of target set selection
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, and Ilan Newman
Discrete Optimization 8 (1): 87-96, 2011
-
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Michael R. Fellows, Guillaume Fertin, Danny Hermelin, and Stephane Vialette
Journal of Computer and System Sciences 77 (4): 799-811, 2011
-
Minimum Vertex Cover in Rectangle Graphs
Reuven Bar-Yehuda, Danny Hermelin, and Dror Rawitz
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, Liverpool, England, 2010, 255-266
-
Mod/Resc Parsimony Inference
Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max Reuter, and Olivier Sagot, Marie-France Duron
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, New York, USA, 2010, 202-213
-
Optimization problems in multiple-interval graphs
Ayelet Butman, Danny Hermelin, Moshe Lewenstein, and Dror Rawitz
ACM Transactions on Algorithms 6 (2): 40,1-40,18, 2010
-
Restricted LCS
Zvi Gotthilf, Danny Hermelin, Gad M. Landau, and Moshe Lewenstein
In: 17th International Symposium on String Processing and Information Retrieval, Los Cabos, Mexico, 2010, 250-257