Incompressibility through Colors and IDs-Reference-Cited by-同舟云学术

Incompressibility through Colors and IDs

Published:2009 Issue: Volume: Page:378-389
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Dom Michael,Lokshtanov Daniel,Saurabh Saket

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-02927-1_32

Reference15 articles.

1. Lecture Notes in Computer Science;F.N. Abu-Khzam,2007

2. Alon, N., Gutner, S.: Kernels for the dominating set problem on graphs with an excluded minor. Technical Report TR08-066, Electronic Colloquium on Computational Complexity (ECCC) (2008)

3. Betzler, N.: Steiner tree problems in the analysis of biological networks. Diploma thesis, Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Germany (2006)

4. Lecture Notes in Computer Science;H.L. Bodlaender,2008

5. Bodlaender, H.L., Thomassé, S., Yeo, A.: Analysis of data reduction: Transformations give evidence for non-existence of polynomial kernels. Technical Report UU-CS-2008-030, Institute of Information and Computing Sciences, Utrecht University, Netherlands (2008)

Cited by 127 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On convexity in split graphs: complexity of Steiner tree and domination;Journal of Combinatorial Optimization;2024-02-12

2. Planar Disjoint Paths, Treewidth, and Kernels;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy;Journal of Combinatorial Optimization;2022-07-22

4. On the Kernel and Related Problems in Interval Digraphs;Algorithmica;2022-07-19

5. P Versus NPC: Minimum Steiner Trees in Convex Split Graphs;Algorithms and Discrete Applied Mathematics;2022