Author image not provided
 Jakub Onufry Wojtaszczyk

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article8.65
Citation Count173
Publication count20
Publication years2003-2015
Available for download2
Average downloads per article131.00
Downloads (cumulative)262
Downloads (12 Months)40
Downloads (6 Weeks)1
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


20 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 20
Result page: 1 2

Sort by:

1
February 2015 Theory of Computing Systems: Volume 56 Issue 2, February 2015
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Signed graphs, i.e., undirected graphs with edges labelled with a plus or minus sign, are commonly used to model relationships in social networks. Recently, Kermarrec and Thraves (2011) initiated the study of the problem of appropriately visualising the network: They asked whether any signed graph can be embedded into the ...
Keywords: Relationships, Embedding into metric space, Signed graphs

2
October 2014 Algorithmica: Volume 70 Issue 2, October 2014
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

The 2-Disjoint Connected Subgraphs problem, given a graph along with two disjoint sets of terminals Z 1 , Z 2 , asks whether it is possible to find disjoint sets A 1 , A 2 , such that Z 1 ⊆ A 1 , Z 2 ⊆ A 2 and ...
Keywords: Exact algorithms, Exponential Time Hypothesis, 2-Disjoint Connected Subgraphs, 2n barrier, Kernelization

3 published by ACM
May 2013 ACM Transactions on Computation Theory (TOCT): Volume 5 Issue 1, May 2013
Publisher: ACM
Bibliometrics:
Citation Count: 14
Downloads (6 Weeks): 5,   Downloads (12 Months): 26,   Downloads (Overall): 177

Full text available: PDFPDF
We introduce a concept of parameterizing a problem above the optimum solution of its natural linear programming relaxation and prove that the node multiway cut problem is fixed-parameter tractable (FPT) in this setting. As a consequence we prove that node multiway cut is FPT, when parameterized above the maximum separating ...
Keywords: linear programming, multiway cut, parameterized algorithms, Fixed parameter tractability

4
October 2012 Discrete Applied Mathematics: Volume 160 Issue 15, October, 2012
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 2

A graph is d-degenerate if every subgraph contains a vertex of degree at most d. For instance, planar graphs are 5-degenerate. Inspired by the recent work by Philip, Raman and Sikdar, who have shown the existence of a polynomial kernel for Dominating Set in d-degenerate graphs, we investigate the kernelization ...
Keywords: Degenerate graphs, Graph motif, Connected dominating set, Kernelization

5
September 2012 Algorithmica: Volume 64 Issue 1, September 2012
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

The Pathwidth One Vertex Deletion (POVD) problem asks whether, given an undirected graph G and an integer k, one can delete at most k vertices from G so that the remaining graph has pathwidth at most 1. The question can be considered as a natural variation of the extensively studied ...
Keywords: Caterpillar graph, Kernelization, Pathwidth, Fixed parameter tractability

6
September 2012 Algorithmica - Special Issue: Parameterized and Exact Computation, Part I: Volume 64 Issue 1, September 2012
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

The Pathwidth One Vertex Deletion (POVD) problem asks whether, given an undirected graph  G and an integer k , one can delete at most k vertices from  G so that the remaining graph has pathwidth at most 1. The question can be considered as a natural variation of the extensively ...
Keywords: Caterpillar graph, Kernelization, Pathwidth

7
April 2012 LATIN'12: Proceedings of the 10th Latin American international conference on Theoretical Informatics
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

The 2-Disjoint Connected Subgraphs problem, given a graph along with two disjoint sets of terminals Z 1 , Z 2 , asks whether it is possible to find disjoint sets A 1 , A 2 , such that Z 1 ⊆ A 1 , Z 2 ⊆ A 2 and ...

8
December 2011 Information Processing Letters: Volume 111 Issue 23-24, December, 2011
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 0

In this paper we consider the Capacitated Dominating Set problem - a generalisation of the Dominating Set problem where each vertex v is additionally equipped with a number c(v), which is the number of other vertices this vertex has the capacity to dominate. We provide an algorithm that solves Capacitated ...
Keywords: Capacitated domination, Dominating set, Exponential algorithms, Graph algorithms

9
November 2011 Theoretical Computer Science: Volume 412 Issue 50, November, 2011
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 6

We show that the Dominating Set problem parameterized by solution size is fixed-parameter tractable (FPT) in graphs that do not contain the claw (K"1","3, the complete bipartite graph on four vertices where the two parts have one and three vertices, respectively) as an induced subgraph. We present an algorithm that ...
Keywords: Connected dominating set, Dominating set, Clique, Claw-free graphs, Fixed parameter tractability

10
October 2011 FOCS '11: Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 54

For the vast majority of local problems on graphs of small tree width (where by local we mean that a solution can be verified by checking separately the neighbourhood of each vertex), standard dynamic programming techniques give c^tw |V|^O(1) time algorithms, where tw is the tree width of the input ...
Keywords: treewidth, ?xed parameter tractability, randomized algorithms, exact algorithms

11
September 2011 IPEC'11: Proceedings of the 6th international conference on Parameterized and Exact Computation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 19

In this paper we consider two above lower bound parameterizations of the NodeMultiway Cut problem -- above the maximum separating cut and above a natural LP-relaxation -- and prove them to be fixed-parameter tractable. Our results imply O * (4 k ) algorithms for Vertex Coverabove Maximum Matching and Almost ...

12
September 2011 ESA'11: Proceedings of the 19th European conference on Algorithms
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 5

In the SCHED problem we are given a set of n jobs, together with their processing times and precedence constraints. The task is to order the jobs so that their total completion time is minimized. SCHED is a special case of the Traveling Repairman Problem with precedences. A natural dynamic ...
Keywords: moderately exponential algorithms, jobs scheduling, jobs with precedences

13
September 2011 Journal of Discrete Algorithms: Volume 9 Issue 3, September, 2011
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 5

The lower and the upper irredundance numbers of a graph G, denoted ir(G) and IR(G), respectively, are conceptually linked to the domination and independence numbers and have numerous relations to other graph parameters. It has been an open question whether determining these numbers for a graph G on n vertices ...
Keywords: Irredundance number, Graph algorithms

14
July 2011 ICALP'11: Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 13

The classical FEEDBACK VERTEX SET problem asks, for a given undirected graph G and an integer k , to find a set of at most k vertices that hits all the cycles in the graph G . FEEDBACK VERTEX SET has attracted a large amount of research in the parameterized ...

15
July 2011 ICALP'11: Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We study a capacitated network design problem in geometric setting. We assume that the input consists of an integral link capacity k and two sets of points on a plane, sources and sinks, each source/sink having an associated integral demand (amount of flow to be shipped from/to). The capacitated geometric ...

16
January 2011 SODA '11: Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 1,   Downloads (12 Months): 2,   Downloads (Overall): 42

Full text available: PDFPDF
We present a polynomial time algorithm for the 3-Compatible colouring problem, where we are given a complete graph with each edge assigned one of 3 possible colours and we want to assign one of those 3 colours to each vertex in such a way that no edge has the same ...

17
June 2010 WG'10: Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 9

A graph is d -degenerate if its every subgraph contains a vertex of degree at most d . For instance, planar graphs are 5-degenerate. Inspired by recent work by Philip, Raman and Sikdar, who have shown the existence of a polynomial kernel for DOMINATING SET in d -degenerate graphs, we ...

18
June 2010 SWAT'10: Proceedings of the 12th Scandinavian conference on Algorithm Theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 7

In this paper we consider the Capacitated Dominating Set problem — a generalisation of the Dominating Set problem where each vertex v is additionally equipped with a number c ( v ), which is the number of other vertices this vertex can dominate. We provide an algorithm that solves Capacitated ...

19
May 2010 CIAC'10: Proceedings of the 7th international conference on Algorithms and Complexity
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

In this paper we provide algorithms faster than O (2 n ) for two variants of the Irredundant Set problem. More precisely, we give: a branch-and-reduce algorithm solving Largest Irredundant Set in $\mathcal{O}(1.9657^{n})$ time and polynomial space; the time complexity can be reduced using memoization to $\mathcal{O}(1.8475^{n})$ at the cost ...

20
October 2003 Journal of Complexity: Volume 19 Issue 5, October 2003
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 4

It has long been known that the multivariate integration problem for the unit ball in C r ([0,1] d ) is intractable for fixed finite r . H. Wozniakowski has recently conjectured that this is true even if r = ∞. This paper establishes a partial result in this direction. ...



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