default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20th FCT 2015: Gdańsk, Poland
- Adrian Kosowski, Igor Walukiewicz:
Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings. Lecture Notes in Computer Science 9210, Springer 2015, ISBN 978-3-319-22176-2
Invited talks
- Marek Karpinski:
Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies. 3-11 - Antonín Kucera:
On the Existence and Computability of Long-Run Average Properties in Probabilistic VASS. 12-24
Geometry, Combinatorics, Text Algorithms
- Pawel Gawrychowski, Florin Manea:
Longest α-Gapped Repeat and Palindrome. 27-40 - Ana Paula Tomás
:
On the Enumeration of Permutominoes. 41-52 - Mercè Claverol, Delia Garijo, Matias Korman, Carlos Seara, Rodrigo I. Silveira:
Stabbing Segments with Rectilinear Objects. 53-64 - Miroslaw Kowaluk, Gabriela Majewska:
β-skeletons for a Set of Line Segments in R2. 65-78
Complexity and Boolean Functions
- Philippe Moser, Frank Stephan:
Depth, Highness and DNR Degrees. 81-94 - N. R. Aravind, Pushkar S. Joglekar:
On the Expressive Power of Read-Once Determinants. 95-105 - Joan Boyar, Magnus Gausdal Find:
Constructive Relationships Between Algebraic Thickness and Normality. 106-117 - Patrick Scharpfenecker:
On the Structure of Solution-Graphs for Boolean Formulas. 118-130
Languages
- Pierre Ganty, Radu Iosif:
Interprocedural Reachability for Flat Integer Programs. 133-145 - Janusz A. Brzozowski, Marek Szykula:
Complexity of Suffix-Free Regular Languages. 146-159 - Luc Dartois, Charles Paperman:
Alternation Hierarchies of First Order Logic with Regular Predicates. 160-172 - Wojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun:
A Note on Decidable Separability by Piecewise Testable Languages. 173-185
Set Algorithms, Covering, and Traversal
- Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant:
Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations. 189-201 - Ricardo Andrade, Etienne Birmelé, Arnaud Mary, Thomas Picchetti, Marie-France Sagot:
Incremental Complexity of a Bi-objective Hypergraph Transversal Problem. 202-213 - Peter Damaschke:
Pairs Covered by a Sequence of Sets. 214-226 - Barbara Geissmann, Matús Mihalák, Peter Widmayer:
Recurring Comparison Faults: Sorting and Finding the Minimum. 227-239
Graph Algorithms and Networking Applications
- Marcin Kaminski, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos:
Minimal Disconnected Cuts in Planar Graphs. 243-254 - Annalisa De Bonis, Ugo Vaccaro:
ϵ-Almost Selectors and Their Applications. 255-268 - Srimanta Bhattacharya:
Derandomized Construction of Combinatorial Batch Codes. 269-282 - Iain A. Stewart:
On the Mathematics of Data Centre Network Topologies. 283-295
Anonymity and Indistinguishability
- Nimrod Talmon:
Privacy in Elections: k-Anonymizing Preference Orders. 299-310 - Alberto Cappai, Ugo Dal Lago:
On Equivalences, Metrics, and Polynomial Time. 311-323
Graphs, Automata, and Dynamics
- Martin Lange, Étienne Lozes:
Conjunctive Visibly-Pushdown Path Queries. 327-338 - Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky:
On the Power of Color Refinement. 339-350 - Pablo Arrighi, Simon Martiel, Simon Perdrix:
Block Representation of Reversible Causal Graph Dynamics. 351-363
Logic and Games
- Clemens Kupke, Dirk Pattinson, Lutz Schröder:
Reasoning with Global Assumptions in Arithmetic Modal Logics. 367-380 - Bruno Karelovic, Wieslaw Zielonka:
Nearest Fixed Points and Concurrent Priority Games. 381-393
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-21 20:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
