LIPIcs, Volume 138, MFCS'19, Complete Volume (Englisch)
Freier Zugriff
- Neue Suche nach: Rossmanith, Peter
- Weitere Informationen zu Rossmanith, Peter:
- https://orcid.org/0000-0003-0177-8028
- Neue Suche nach: Heggernes, Pinar
- Weitere Informationen zu Heggernes, Pinar:
- https://orcid.org/0000-0001-9460-4355
- Neue Suche nach: Katoen, Joost-Pieter
- Weitere Informationen zu Katoen, Joost-Pieter:
- https://orcid.org/0000-0002-6143-1926
- Neue Suche nach: Rossmanith, Peter
- Weitere Informationen zu Rossmanith, Peter:
- https://orcid.org/0000-0003-0177-8028
- Neue Suche nach: Heggernes, Pinar
- Weitere Informationen zu Heggernes, Pinar:
- https://orcid.org/0000-0001-9460-4355
- Neue Suche nach: Katoen, Joost-Pieter
- Weitere Informationen zu Katoen, Joost-Pieter:
- https://orcid.org/0000-0002-6143-1926
2019
-
ISBN:
-
ISSN:
- Konferenzband / Elektronische Ressource
-
Titel:LIPIcs, Volume 138, MFCS'19, Complete Volume
-
Beteiligte:Rossmanith, Peter ( Autor:in , Herausgeber:in ) / Heggernes, Pinar ( Autor:in , Herausgeber:in ) / Katoen, Joost-Pieter ( Autor:in , Herausgeber:in )
-
Erschienen in:
-
Verlag:
- Neue Suche nach: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Erscheinungsdatum:03.09.2019
-
Format / Umfang:1182 pages , 41462213 byte
-
Anmerkungen:LIPIcs, Vol. 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), pages 0-0
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Konferenzband
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Lizenzbestimmungen:
-
Datenquelle:
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Trustworthy Graph Algorithms (Invited Talk)Abdulaziz, Mohammad / Mehlhorn, Kurt / Nipkow, Tobias et al. | 2019
- 2
-
Guarded Kleene Algebra with Tests: Verification of Uninterpreted Programs in Nearly Linear Time (Invited Talk)Silva, Alexandra et al. | 2019
- 3
-
Picking Random Vertices (Invited Talk)Lokshtanov, Daniel et al. | 2019
- 4
-
Popular Matchings: Good, Bad, and Mixed (Invited Talk)Kavitha, Telikepalli et al. | 2019
- 5
-
Petri Net Reachability Problem (Invited Talk)Leroux, Jérôme et al. | 2019
- 6
-
An Improved Online Algorithm for the Traveling Repairperson Problem on a LineBienkowski, Marcin / Liu, Hsiang-Hsuan et al. | 2019
- 7
-
Query-Competitive Sorting with UncertaintyHalldórsson, Magnús M. / de Lima, Murilo Santos et al. | 2019
- 8
-
Better Bounds for Online Line ChasingBienkowski, Marcin / Byrka, Jarosław / Chrobak, Marek / Coester, Christian / Jeż, Łukasz / Koutsoupias, Elias et al. | 2019
- 9
-
Nash Equilibria in Games over Graphs Equipped with a Communication MechanismBouyer, Patricia / Thomasset, Nathan et al. | 2019
- 10
-
Parity Games: Zielonka’s Algorithm in Quasi-Polynomial TimeParys, Paweł et al. | 2019
- 11
-
Bidding Mechanisms in Graph GamesAvni, Guy / Henzinger, Thomas A. / Žikelić, Đorđe et al. | 2019
- 12
-
Cluster Deletion on Interval Graphs and Split Related GraphsKonstantinidis, Athanasios L. / Papadopoulos, Charis et al. | 2019
- 13
-
Constrained Representations of Map Graphs and Half-SquaresLe, Hoang-Oanh / Le, Van Bang et al. | 2019
- 14
-
Colouring H-Free Graphs of Bounded DiameterMartin, Barnaby / Paulusma, Daniël / Smith, Siani et al. | 2019
- 15
-
Distance Labeling Schemes for Cube-Free Median GraphsChepoi, Victor / Labourel, Arnaud / Ratel, Sébastien et al. | 2019
- 16
-
One-Dimensional Guarded FragmentsKieroński, Emanuel et al. | 2019
- 17
-
Finite Satisfiability of Unary Negation Fragment with TransitivityDanielski, Daniel / Kieroński, Emanuel et al. | 2019
- 18
-
The Fluted Fragment with TransitivityPratt-Hartmann, Ian / Tendera, Lidia et al. | 2019
- 19
-
Counting of Teams in First-Order Team LogicsHaak, Anselm / Kontinen, Juha / Müller, Fabian / Vollmer, Heribert / Yang, Fan et al. | 2019
- 20
-
Approximating Activation Edge-Cover and Facility Location ProblemsNutov, Zeev / Kortsarz, Guy / Shalom, Eli et al. | 2019
- 21
-
Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal GraphsKonrad, Christian / Zamaraev, Viktor et al. | 2019
- 22
-
Multistage KnapsackBampis, Evripidis / Escoffier, Bruno / Teiller, Alexandre et al. | 2019
- 23
-
Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time ComputationsBournez, Olivier / Durand, Arnaud et al. | 2019
- 24
-
On the Coalgebra of Partial Differential EquationsBoreale, Michele et al. | 2019
- 25
-
Random Subgroups of RationalsGao, Ziyuan / Jain, Sanjay / Khoussainov, Bakhadyr / Li, Wei / Melnikov, Alexander / Seidel, Karen / Stephan, Frank et al. | 2019
- 26
-
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardnessDörfler, Julian / Roth, Marc / Schmitt, Johannes / Wellnitz, Philip et al. | 2019
- 27
-
Packing Arc-Disjoint Cycles in TournamentsBessy, Stéphane / Bougeret, Marin / Krithika, R. / Sahu, Abhishek / Saurabh, Saket / Thiebaut, Jocelyn / Zehavi, Meirav et al. | 2019
- 28
-
A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete DigraphsMadathil, Jayakrishnan / Sharma, Roohani / Zehavi, Meirav et al. | 2019
- 29
-
The Quantifier Alternation Hierarchy of Synchronous RelationsFigueira, Diego / Ramanathan, Varun / Weil, Pascal et al. | 2019
- 30
-
Two variable fragment of Term Modal LogicPadmanabha, Anantha / Ramanujam, R. et al. | 2019
- 31
-
Choiceless Logarithmic SpaceGrädel, Erich / Schalthöfer, Svenja et al. | 2019
- 32
-
Faster FPT Algorithm for 5-Path Vertex CoverČervený, Radovan / Suchý, Ondřej et al. | 2019
- 33
-
Parameterized Complexity of Fair Vertex Evaluation ProblemsKnop, Dušan / Masařík, Tomáš / Toufar, Tomáš et al. | 2019
- 34
-
A Complexity Dichotomy for Critical Values of the b-Chromatic Number of GraphsJaffke, Lars / Lima, Paloma T. et al. | 2019
- 35
-
Parameterized Complexity of Conflict-Free Matchings and PathsAgrawal, Akanksha / Jain, Pallavi / Kanesh, Lawqueen / Saurabh, Saket et al. | 2019
- 36
-
On the Strength of Uniqueness Quantification in Primitive Positive FormulasLagerkvist, Victor / Nordh, Gustav et al. | 2019
- 37
-
Resolution Lower Bounds for Refutation StatementsGarlík, Michal et al. | 2019
- 38
-
Tangles and Single Linkage Hierarchical ClusteringFluck, Eva et al. | 2019
- 39
-
Approximating the Orthogonality Dimension of Graphs and HypergraphsHaviv, Ishay et al. | 2019
- 40
-
Domination Above r-Independence: Does Sparseness Help?Einarson, Carl / Reidl, Felix et al. | 2019
- 41
-
Reducing the Domination Number of Graphs via Edge ContractionsGalby, Esther / Lima, Paloma T. / Ries, Bernard et al. | 2019
- 42
-
Measuring what Matters: A Hybrid Approach to Dynamic Programming with TreewidthEiben, Eduard / Ganian, Robert / Hamm, Thekla / Kwon, O-joung et al. | 2019
- 43
-
The Power Word ProblemLohrey, Markus / Weiß, Armin et al. | 2019
- 44
-
Upper Bounds on the Length of Minimal Solutions to Certain Quadratic Word EquationsDay, Joel D. / Manea, Florin / Nowotka, Dirk et al. | 2019
- 45
-
The Power of the Weisfeiler-Leman Algorithm to Decompose GraphsKiefer, Sandra / Neuen, Daniel et al. | 2019
- 46
-
The Domino Problem is Undecidable on Surface GroupsAubrun, Nathalie / Barbieri, Sebastián / Moutot, Etienne et al. | 2019
- 47
-
P-Optimal Proof Systems for Each NP-Set but no Complete Disjoint NP-Pairs Relative to an OracleDose, Titus et al. | 2019
- 48
-
Semicomputable Points in Euclidean SpacesHoyrup, Mathieu / Stull, Donald M. et al. | 2019
- 49
-
Bounded-Depth Frege Complexity of Tseitin Formulas for All GraphsGalesi, Nicola / Itsykson, Dmitry / Riazanov, Artur / Sofronova, Anastasia et al. | 2019
- 50
-
On the Expressivity of Linear Recursion SchemesClairambault, Pierre / Murawski, Andrzej S. et al. | 2019
- 51
-
Uniform Random Expressions Lack ExpressivityKoechlin, Florent / Nicaud, Cyril / Rotondo, Pablo et al. | 2019
- 52
-
Lower Bounds for Multilinear Order-Restricted ABPsRamya, C. / Rao, B. V. Raghavendra et al. | 2019
- 53
-
On the Symmetries of and Equivalence Test for Design PolynomialsGupta, Nikhil / Saha, Chandan et al. | 2019
- 54
-
The Complexity of Homomorphism IndistinguishabilityBöker, Jan / Chen, Yijia / Grohe, Martin / Rattan, Gaurav et al. | 2019
- 55
-
SZX-Calculus: Scalable Graphical Quantum ReasoningCarette, Titouan / Horsman, Dominic / Perdrix, Simon et al. | 2019
- 56
-
On the Stretch Factor of Polygonal ChainsChen, Ke / Dumitrescu, Adrian / Mulzer, Wolfgang / Tóth, Csaba D. et al. | 2019
- 57
-
Deleting Edges to Restrict the Size of an Epidemic in Temporal NetworksEnright, Jessica / Meeks, Kitty / Mertzios, George B. / Zamaraev, Viktor et al. | 2019
- 58
-
Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular WidthBerkholz, Christoph / Schweikardt, Nicole et al. | 2019
- 59
-
Counting Homomorphisms Modulo a Prime NumberKazeminia, Amirhossein / Bulatov, Andrei A. et al. | 2019
- 60
-
Approximate Counting CSP Seen from the Other SideBulatov, Andrei A. / Živný, Stanislav et al. | 2019
- 61
-
Uniformisation Gives the Full Strength of Regular LanguagesLhote, Nathan / Michielini, Vincent / Skrzypczak, Michał et al. | 2019
- 62
-
New Pumping Technique for 2-Dimensional VASSCzerwiński, Wojciech / Lasota, Sławomir / Löding, Christof / Piórkowski, Radosław et al. | 2019
- 63
-
Computational Complexity of Synchronization under Regular ConstraintsFernau, Henning / Gusev, Vladimir V. / Hoffmann, Stefan / Holzer, Markus / Volkov, Mikhail V. / Wolf, Petra et al. | 2019
- 64
-
A Constant-Time Colored Choice Dictionary with Almost Robust IterationHagerup, Torben et al. | 2019
- 65
-
Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet EfficientBaswana, Surender / Gupta, Shiv / Tulsyan, Ayush et al. | 2019
- 66
-
RLE Edit Distance in Near Optimal TimeClifford, Raphaël / Gawrychowski, Paweł / Kociumaka, Tomasz / Martin, Daniel P. / Uznański, Przemysław et al. | 2019
- 67
-
Indexing Graph Search Trees and ApplicationsChakraborty, Sankardeep / Sadakane, Kunihiko et al. | 2019
- 68
-
Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic PropertiesDennunzio, Alberto / Formenti, Enrico / Grinberg, Darij / Margara, Luciano et al. | 2019
- 69
-
On Synthesis of Resynchronizers for TransducersBose, Sougata / Krishna, Shankara Narayanan / Muscholl, Anca / Penelle, Vincent / Puppis, Gabriele et al. | 2019
- 70
-
Acceptance Ambiguity for Quantum AutomataBell, Paul C. / Hirvensalo, Mika et al. | 2019
- 71
-
From Regular Expression Matching to ParsingBille, Philip / Gørtz, Inge Li et al. | 2019
- 72
-
Solving Systems of Equations in Supernilpotent AlgebrasAichinger, Erhard et al. | 2019
- 73
-
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in GraphsConte, Alessio / Grossi, Roberto / Kanté, Mamadou Moustapha / Marino, Andrea / Uno, Takeaki / Wasa, Kunihiro et al. | 2019
- 74
-
Enumeration of Preferred Extensions in Almost Oriented DigraphsGaspers, Serge / Li, Ray et al. | 2019
- 75
-
Determinisation of Finitely-Ambiguous Copyless Cost Register AutomataLopez, Théodore / Monmege, Benjamin / Talbot, Jean-Marc et al. | 2019
- 76
-
Aperiodic Weighted Automata and Weighted First-Order LogicDroste, Manfred / Gastin, Paul et al. | 2019
- 77
-
A Congruence-based Perspective on Automata Minimization AlgorithmsGanty, Pierre / Gutiérrez, Elena / Valero, Pedro et al. | 2019
- 78
-
Finding Optimal Solutions With Neighborly HelpBurjons, Elisabet / Frei, Fabian / Hemaspaandra, Edith / Komm, Dennis / Wehner, David et al. | 2019
- 79
-
Reconfiguration of Minimum Steiner Trees via Vertex ExchangesMizuta, Haruka / Hatanaka, Tatsuhiko / Ito, Takehiro / Zhou, Xiao et al. | 2019
- 80
-
The Perfect Matching Reconfiguration ProblemBonamy, Marthe / Bousquet, Nicolas / Heinrich, Marc / Ito, Takehiro / Kobayashi, Yusuke / Mary, Arnaud / Mühlenthaler, Moritz / Wasa, Kunihiro et al. | 2019
- 81
-
Spectral Aspects of Symmetric Matrix SigningsCarlson, Charles / Chandrasekaran, Karthekeyan / Chang, Hsien-Chih / Kakimura, Naonori / Kolla, Alexandra et al. | 2019
- 82
-
Efficient Analysis of Unambiguous Automata Using Matrix Semigroup TechniquesKiefer, Stefan / Widdershoven, Cas et al. | 2019
- 83
-
On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and BeyondBell, Paul C. / Potapov, Igor / Semukhin, Pavel et al. | 2019