Vertex Disjoint Paths in Upward Planar Graphs (English)
- New search for: Akhoondian Amiri, Saeed
- New search for: Golshani, Ali
- New search for: Kreutzer, Stephan
- New search for: Siebertz, Sebastian
- New search for: Akhoondian Amiri, Saeed
- New search for: Golshani, Ali
- New search for: Kreutzer, Stephan
- New search for: Siebertz, Sebastian
In:
Computer Science - Theory and Applications
;
52-64
;
2014
- Article/Chapter (Book) / Electronic Resource
-
Title:Vertex Disjoint Paths in Upward Planar Graphs
-
Contributors:Akhoondian Amiri, Saeed ( author ) / Golshani, Ali ( author ) / Kreutzer, Stephan ( author ) / Siebertz, Sebastian ( author )
-
Published in:Lecture Notes in Computer Science ; 8476 ; 52-64
-
Publisher:
- New search for: Springer International Publishing
-
Place of publication:Cham
-
Publication date:2014-01-01
-
Size:13 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
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
-
Finding All Solutions of Equations in Free Groups and Monoids with InvolutionDiekert, Volker / Jeż, Artur / Plandowski, Wojciech et al. | 2014
- 16
-
Algorithmic Meta Theorems for Sparse Graph ClassesGrohe, Martin et al. | 2014
- 23
-
The Lattice of Definability. Origins, Recent Developments, and Further DirectionsSemenov, Alexei / Soprunov, Sergey / Uspensky, Vladimir et al. | 2014
- 39
-
Counting Popular Matchings in House Allocation ProblemsAcharyya, Rupam / Chakraborty, Sourav / Jha, Nitesh et al. | 2014
- 52
-
Vertex Disjoint Paths in Upward Planar GraphsAkhoondian Amiri, Saeed / Golshani, Ali / Kreutzer, Stephan / Siebertz, Sebastian et al. | 2014
- 65
-
On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative DomainsArvind, V. / Raja, S. / Sreejith, A. V. et al. | 2014
- 77
-
Testing Low Degree Trigonometric PolynomialsBaartse, Martijn / Meer, Klaus et al. | 2014
- 97
-
Property Testing Bounds for Linear and Quadratic Functions via Parity Decision TreesBhrushundi, Abhishek / Chakraborty, Sourav / Kulkarni, Raghav et al. | 2014
- 111
-
A Fast Branching Algorithm for Cluster Vertex DeletionBoral, Anudhyan / Cygan, Marek / Kociumaka, Tomasz / Pilipczuk, Marcin et al. | 2014
- 125
-
Separation Logic with One Quantified VariableDemri, Stéphane / Galmiche, Didier / Larchey-Wendling, Dominique / Méry, Daniel et al. | 2014
- 139
-
QuickXsort: Efficient Sorting with n logn − 1.399n + o(n) Comparisons on AverageEdelkamp, Stefan / Weiß, Armin et al. | 2014
- 153
-
Notions of Metric Dimension of Corona Products: Combinatorial and Computational ResultsFernau, Henning / Rodríguez-Velázquez, Juan Alberto et al. | 2014
- 167
-
On the Complexity of Computing Two Nonlinearity MeasuresFind, Magnus Gausdal et al. | 2014
- 176
-
Block Products and Nesting Negations in FO2Fleischer, Lukas / Kufleitner, Manfred / Lauser, Alexander et al. | 2014
- 190
-
Model Checking for String ProblemsHutagalung, Milka / Lange, Martin et al. | 2014
- 204
-
Semiautomatic StructuresJain, Sanjay / Khoussainov, Bakhadyr / Stephan, Frank / Teng, Dan / Zou, Siyuan et al. | 2014
- 218
-
The Query Complexity of Witness FindingKawachi, Akinori / Rossman, Benjamin / Watanabe, Osamu et al. | 2014
- 232
-
Primal Implication as EncryptionKrupski, Vladimir N. et al. | 2014
- 245
-
Processing Succinct Matrices and VectorsLohrey, Markus / Schmidt-Schauß, Manfred et al. | 2014
- 259
-
Constraint Satisfaction with Counting Quantifiers 2Martin, Barnaby / Stacho, Juraj et al. | 2014
- 273
-
Dynamic Complexity of Planar 3-Connected Graph IsomorphismMehta, Jenish C. et al. | 2014
- 287
-
Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational FunctionsPan, Victor Y. et al. | 2014
- 300
-
First-Order Logic on CPDA GraphsParys, Paweł et al. | 2014
- 314
-
Recognizing Two-Sided Contexts in Cubic TimeRabkin, Max et al. | 2014
- 325
-
A Parameterized Algorithm for Packing Overlapping SubgraphsRomero, Jazmń / López-Ortiz, Alejandro et al. | 2014
- 337
-
Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal ObstaclesSchüler, Julia / Spillner, Andreas et al. | 2014
- 351
-
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and CircuitsSchwerdtfeger, Konrad et al. | 2014
- 365
-
Randomized Communication Complexity of Approximating Kolmogorov ComplexityVereshchagin, Nikolay et al. | 2014
- 375
-
Space Saving by Dynamic AlgebraizationFürer, Martin / Yu, Huiwen et al. | 2014