Editing to Connected f-Degree Graph (English)
Free access
- New search for: Fomin, Fedor V.
- New search for: Golovach, Petr
- New search for: Panolan, Fahad
- New search for: Saurabh, Saket
- New search for: Fomin, Fedor V.
- New search for: Golovach, Petr
- New search for: Panolan, Fahad
- New search for: Saurabh, Saket
- New search for: Ollinger, Nicolas
- New search for: Vollmer, Heribert
In:
LIPIcs, Volume 47, STACS 2016
: 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)
;
47
;
36:1-36:14
;
2016
-
ISBN:
-
ISSN:
- Conference paper / Electronic Resource
-
Title:Editing to Connected f-Degree Graph
-
Contributors:Fomin, Fedor V. ( author ) / Golovach, Petr ( author ) / Panolan, Fahad ( author ) / Saurabh, Saket ( author ) / Ollinger, Nicolas ( editor ) / Vollmer, Heribert ( editor )
-
Published in:LIPIcs, Volume 47, STACS 2016 : 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016) ; 47 ; 36:1-36:14Leibniz International Proceedings in Informatics (LIPIcs) ; 47 ; 36:1-36:14
-
Publisher:
- New search for: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Publication date:2016-02-16
-
Size:14 pages , 714094 byte
-
Remarks:LIPIcs, Vol. 47, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), pages 36:1-36:14
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Conference paper
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Licence:
-
Source:
Table of contents conference proceedings
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Ideal Decompositions for Vector Addition Systems (Invited Talk)Leroux, Jérôme / Schmitz, Sylvain et al. | 2016
- 2
-
Complexity and Expressive Power of Ontology-Mediated Queries (Invited Talk)Lutz, Carsten et al. | 2016
- 3
-
Fine-Grained Algorithms and Complexity (Invited Talk)Vassilevska Williams, Virginia et al. | 2016
- 4
-
Tutorial on Cellular Automata and Tilings (Tutorial)Kari, Jarkko et al. | 2016
- 5
-
Graph Reconstruction with a Betweenness OracleAbrahamsen, Mikkel / Bodwin, Greg / Rotenberg, Eva / Stöckel, Morten et al. | 2016
- 6
-
Airports and Railways: Facility Location Meets Network DesignAdamaszek, Anna / Antoniadis, Antonios / Mömke, Tobias et al. | 2016
- 7
-
Simultaneous Feedback Vertex Set: A Parameterized PerspectiveAgrawal, Akanksha / Lokshtanov, Daniel / Mouawad, Amer E. / Saurabh, Saket et al. | 2016
- 8
-
On Regularity of Unary Probabilistic AutomataAkshay, S. / Genest, Blaise / Karelovic, Bruno / Vyas, Nikhil et al. | 2016
- 9
-
The Expanding Search Ratio of a GraphAngelopoulos, Spyros / Dürr, Christoph / Lidbetter, Thomas et al. | 2016
- 10
-
Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite GraphsArora, Rahul / Gupta, Ashu / Gurjar, Rohit / Tewari, Raghunath et al. | 2016
- 11
-
Entropy Games and Matrix Multiplication GamesAsarin, Eugene / Cervelle, Julien / Degorre, Aldric / Dima, Catalin / Horn, Florian / Kozyakin, Victor et al. | 2016
- 12
-
Good Predictions Are Worth a Few ComparisonsAuger, Nicolas / Nicaud, Cyril / Pivoteau, Carine et al. | 2016
- 13
-
Dense Subset Sum May Be the HardestAustrin, Per / Kaski, Petteri / Koivisto, Mikko / Nederlof, Jesper et al. | 2016
- 14
-
Computing the L1 Geodesic Diameter and Center of a Polygonal DomainWon Bae, Sang / Korman, Matias / Mitchell, Joseph S. B. / Okamoto, Yoshio / Polishchuk, Valentin / Wang, Haitao et al. | 2016
- 15
-
Are Short Proofs Narrow? QBF Resolution is not SimpleBeyersdorff, Olaf / Chew, Leroy / Mahajan, Meena / Shukla, Anil et al. | 2016
- 16
-
Faster Algorithms for the Constrained k-Means ProblemBhattacharya, Anup / Jaiswal, Ragesh / Kumar, Amit et al. | 2016
- 17
-
A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player GamesBilò, Vittorio / Mavronicolas, Marios et al. | 2016
- 18
-
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path TreesBilò, Davide / Gualà, Luciano / Leucci, Stefano / Proietti, Guido et al. | 2016
- 19
-
On a Fragment of AMSO and Tiling SystemsBlumensath, Achim / Colcombet, Thomas / Parys, Pawel et al. | 2016
- 20
-
The Complexity of Phylogeny Constraint SatisfactionBodirsky, Manuel / Jonsson, Peter / Van Pham, Trung et al. | 2016
- 21
-
The MSO+U Theory of (N,<) Is UndecidableBojanczyk, Mikolaj / Parys, Pawel / Torunczyk, Szymon et al. | 2016
- 22
-
Time-Approximation Trade-offs for Inapproximable ProblemsBonnet, Édouard / Lampis, Michael / Paschos, Vangelis Th. et al. | 2016
- 23
-
External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic UpdatesBrodal, Gerth Stølting et al. | 2016
- 24
-
Catalytic Space: Non-determinism and HierarchyBuhrman, Harry / Koucký, Michal / Loff, Bruno / Speelman, Florian et al. | 2016
- 25
-
Testing Shape Restrictions of Discrete DistributionsCanonne, Clément L. / Diakonikolas, Ilias / Gouleakis, Themis / Rubinfeld, Ronitt et al. | 2016
- 26
-
Deciding Circular-Arc Graph Isomorphism in Parameterized LogspaceChandoo, Maurice et al. | 2016
- 27
-
Bottleneck Paths and Trees and Deterministic Graphical GamesChechik, Shiri / Kaplan, Haim / Thorup, Mikkel / Zamir, Or / Zwick, Uri et al. | 2016
- 28
-
Packing Groups of Items into Multiple KnapsacksChen, Lin / Zhang, Guochuan et al. | 2016
- 29
-
Cost Functions Definable by Min/Max AutomataColcombet, Thomas / Kuperberg, Denis / Manuel, Amaldev / Torunczyk, Szymon et al. | 2016
- 30
-
Varieties of Cost FunctionsDaviaud, Laure / Kuperberg, Denis / Pin, Jean-Éric et al. | 2016
- 31
-
Kernelization and Sparseness: the Case of Dominating SetDrange, Pål Grønås / Dregi, Markus / Fomin, Fedor V. / Kreutzer, Stephan / Lokshtanov, Daniel / Pilipczuk, Marcin / Pilipczuk, Michal / Reidl, Felix / Sánchez Villaamil, Fernando / Saurabh, Saket et al. | 2016
- 32
-
Canonizing Graphs of Bounded Tree Width in LogspaceElberfeld, Michael / Schweitzer, Pascal et al. | 2016
- 33
-
Preprocessing Under UncertaintyFafianie, Stefan / Kratsch, Stefan / Anh Quyen, Vuong et al. | 2016
- 34
-
Characterisation of an Algebraic Algorithm for Probabilistic AutomataFijalkow, Nathanaël et al. | 2016
- 35
-
Semantic Versus Syntactic Cutting PlanesFilmus, Yuval / Hrubeš, Pavel / Lauria, Massimo et al. | 2016
- 36
-
Editing to Connected f-Degree GraphFomin, Fedor V. / Golovach, Petr / Panolan, Fahad / Saurabh, Saket et al. | 2016
- 37
-
Sub-exponential Approximation Schemes for CSPs: From Dense to Almost SparseFotakis, Dimitris / Lampis, Michael / Paschos, Vangelis Th. et al. | 2016
- 38
-
The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum CodegreeGarbe, Frederik / Mycroft, Richard et al. | 2016
- 39
-
Efficiently Finding All Maximal alpha-gapped RepeatsGawrychowski, Pawel / I, Tomohiro / Inenaga, Shunsuke / Köppl, Dominik / Manea, Florin et al. | 2016
- 40
-
On the Number of Lambda Terms With Prescribed Size of Their De Bruijn RepresentationGittenberger, Bernhard / Golebiewski, Zbigniew et al. | 2016
- 41
-
Tightening the Complexity of Equivalence Problems for Commutative GrammarsHaase, Christoph / Hofman, Piotr et al. | 2016
- 42
-
Autoreducibility of NP-Complete SetsHitchcock, John M. / Shafei, Hadi et al. | 2016
- 43
-
A Randomized Polynomial Kernel for Subset Feedback Vertex SetHols, Eva-Maria C. / Kratsch, Stefan et al. | 2016
- 44
-
Periods and Borders of Random WordsHolub, Štepán / Shallit, Jeffrey et al. | 2016
- 45
-
Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially TightJansen, Bart M. P. et al. | 2016
- 46
-
Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three CircuitsKayal, Neeraj / Nair, Vineet / Saha, Chandan et al. | 2016
- 47
-
Towards an Atlas of Computational Learning TheoryKötzing, Timo / Schirneck, Martin et al. | 2016
- 48
-
Quantum Query Complexity of Subgraph Isomorphism and HomomorphismKulkarni, Raghav / Podder, Supartha et al. | 2016
- 49
-
Faster Exact and Parameterized Algorithm for Feedback Vertex Set in TournamentsKumar, Mithilesh / Lokshtanov, Daniel et al. | 2016
- 50
-
Knapsack in Graph Groups, HNN-Extensions and Amalgamated ProductsLohrey, Markus / Zetzsche, Georg et al. | 2016
- 51
-
FPTAS for Hardcore and Ising Models on HypergraphsLu, Pinyan / Yang, Kuan / Zhang, Chihao et al. | 2016
- 52
-
Efficient Enumeration of Solutions Produced by Closure OperationsMary, Arnaud / Strozecki, Yann et al. | 2016
- 53
-
Copyless Cost-Register Automata: Structure, Expressiveness, and Closure PropertiesMazowiecki, Filip / Riveros, Cristian et al. | 2016
- 54
-
Algorithmic Statistics, Prediction and Machine LearningMilovanov, Alexey et al. | 2016
- 55
-
Polynomial Kernels for Deletion to Classes of Acyclic DigraphsMnich, Matthias / van Leeuwen, Erik Jan et al. | 2016
- 56
-
Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Functionde Oliveira Oliveira, Mateus et al. | 2016
- 57
-
On Space Efficiency of Algorithms Working on Structural Decompositions of GraphsPilipczuk, Michal / Wrochna, Marcin et al. | 2016
- 58
-
Improved Approximation Algorithms for Balanced Partitioning ProblemsRäcke, Harald / Stotz, Richard et al. | 2016