Author image not provided
 Michael Dom

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article10.94
Citation Count186
Publication count17
Publication years2004-2014
Available for download1
Average downloads per article186.00
Downloads (cumulative)186
Downloads (12 Months)40
Downloads (6 Weeks)2
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


17 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 17 of 17
Sort by:

1 published by ACM
October 2014 ACM Transactions on Algorithms (TALG): Volume 11 Issue 2, November 2014
Publisher: ACM
Bibliometrics:
Citation Count: 14
Downloads (6 Weeks): 2,   Downloads (12 Months): 40,   Downloads (Overall): 186

Full text available: PDFPDF
In parameterized complexity, each problem instance comes with a parameter k , and a parameterized problem is said to admit a polynomial kernel if there are polynomial time preprocessing rules that reduce the input instance to an instance with size polynomial in k . Many problems have been shown to ...
Keywords: parameterized complexity, Kernelization, lower bounds

2
February 2012 Algorithmica: Volume 62 Issue 1-2, February 2012
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

The NP-complete geometric covering problem Rectangle Stabbing is defined as follows: Given a set  R of axis-parallel rectangles in the plane, a set  L of horizontal and vertical lines in the plane, and a positive integer  k , select at most  k of the lines such that every rectangle is ...
Keywords: Fixed-parameter algorithms, Geometric covering problems, Whardness

3
May 2010 Journal of Computer and System Sciences: Volume 76 Issue 3-4, May, 2010
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 7

We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization finds applications in new polynomial-time approximation algorithms and fixed-parameter tractability results for the NP-hard problem to delete a minimum number of rows or columns from a 0/1-matrix such that ...
Keywords: NP-hard problem, Circular ones property, Consecutive ones property, Exact algorithms, Forbidden submatrix characterization, Fixed-parameter tractability

4
March 2010 Journal of Discrete Algorithms: Volume 8 Issue 1, March, 2010
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 15

Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and improve fixed-parameter tractability results for these problems. We show that Feedback Vertex Set in tournaments (FVST) is amenable to the novel iterative compression technique, and we provide a depth-bounded search tree ...
Keywords: Iterative compression, Tournament, Feedback arc set, Bipartite tournament, Feedback vertex set, Fixed-parameter tractability

5
July 2009 ICALP '09: Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 76

In parameterized complexity each problem instance comes with a parameter <em>k</em> , and a parameterized problem is said to admit a <em>polynomial kernel</em> if there are polynomial time preprocessing rules that reduce the input instance to an instance with size polynomial in <em>k</em> . Many problems have been shown to ...

6
February 2009 WALCOM '09: Proceedings of the 3rd International Workshop on Algorithms and Computation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

The NP-complete geometric covering problem <Emphasis Type="SmallCaps">Rectangle Stabbing</Emphasis> is defined as follows: Given a set of horizontal and vertical lines in the plane, a set of rectangles in the plane, and a positive integer <em>k</em> , select at most <em>k</em> of the lines such that every rectangle is intersected by ...

7
November 2008 Discrete Applied Mathematics: Volume 156 Issue 18, November, 2008
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 2

The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf power. Herein, a 4-leaf power is a graph that can be constructed by considering an unrooted tree-the 4-leaf root-with leaves ...
Keywords: Fixed-parameter tractability, Forbidden subgraph characterization, Graph power, Leaf power, Graph algorithm, Graph modification

8
September 2008 Journal of Discrete Algorithms: Volume 6 Issue 3, September, 2008
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 1

Set Cover problems are of core importance in many applications. In recent research, the ''red-blue variants'' where blue elements all need to be covered whereas red elements add further constraints on the optimality of a covering have received considerable interest. Application scenarios range from data mining to interference reduction in ...
Keywords: Minimum degree hypergraph, NP-completeness, Set cover, Hitting set, Minimum membership set cover

9
June 2008 FAW '08: Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

We study an NP-complete geometric covering problem called <em>d</em><Emphasis Type="SmallCaps">-Dimensional Rectangle Stabbing</Emphasis>, where, given a set of axis-parallel <em>d</em>-dimensional hyperrectangles, a set of axis-parallel (<em>d</em>� 1)-dimensional hyperplanes and a positive integer <em>k</em>, the question is whether one can select at most <em>k</em>of the hyperplanes such that every hyperrectangle is intersected ...

10
May 2008 IWPEC'08: Proceedings of the 3rd international conference on Parameterized and exact computation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 19

Capacitated versions of Vertex Cover and DominatingSet have been studied intensively in terms of polynomial timeapproximation algorithms. Although the problems Dominating Set andVertex Cover have been subjected to considerable scrutiny in theparameterized complexity world, this is not true for their capacitatedversions. Here we make an attempt to understand the behavior ...

11
May 2007 TAMC'07: Proceedings of the 4th international conference on Theory and applications of models of computation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds applications in new polynomial-time approximation algorithms and fixed-parameter tractability results for the problem to find a maximum-size submatrix of a 0/1-matrix such that the submatrix has the C1P. Moreover, ...

12
July 2006 SWAT'06: Proceedings of the 10th Scandinavian conference on Algorithm Theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

The Minimum Membership Set Cover problem has recently been introduced and studied in the context of interference reduction in cellular networks. It has been proven to be notoriously hard in several aspects. Here, we investigate how natural generalizations and variations of this problem behave in terms of the consecutive ones ...

13
May 2006 CIAC'06: Proceedings of the 6th Italian conference on Algorithms and Complexity
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 11

Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed-parameter tractability results for these problems. We show that Feedback Vertex Set in tournaments is amenable to the novel iterative compression technique. Moreover, we provide data reductions and problem ...

14
August 2005 COCOON'05: Proceedings of the 11th annual international conference on Computing and Combinatorics
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

An undirected graph G =( V , E ) is the k -power of an undirected tree T =( V , E ′) if ( u , v )∈ E iff u and v are connected by a path of length at most k in T . The tree T ...

15
August 2005 Proceedings of the 11th Annual International Conference on Computing and Combinatorics - Volume 3595
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

An undirected graph G=V,E is the k-power of an undirected tree T=V,E' if u,v∈ E iff u and﾿v are connected by a path of length at most﾿k in﾿T. The tree﾿T is called the tree root of﾿G. Tree powers can be recognized in polynomial time. The thus naturally arising question is ...

16
June 2005 WG'05: Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 13

The nP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most ℓ edge insertions or deletions such that it becomes a 4-leaf power. Herein, a 4-leaf power is a graph that can be constructed by considering an unrooted tree—the 4-leaf root—with leaves ...

17
December 2004 ISAAC'04: Proceedings of the 15th international conference on Algorithms and Computation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 11

The k -Leaf Root problem is a particular case of graph power problems Here, we study “error correction” versions of k -Leaf Root—that is, for instance, adding or deleting at most l edges to generate a graph that has a k -leaf root We provide several NP-completeness results in this ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us