| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Torben Hagerup |
A Constant-Time Colored Choice Dictionary with Almost Robust Iteration.  |
MFCS  |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha |
Popular Matchings: Good, Bad, and Mixed (Invited Talk). |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Titus Dose |
P-Optimal Proof Systems for Each NP-Set but no Complete Disjoint NP-Pairs Relative to an Oracle. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Ray Li |
Enumeration of Preferred Extensions in Almost Oriented Digraphs. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles Carlson 0002, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla |
Spectral Aspects of Symmetric Matrix Signings. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Ke Chen 0011, Adrian Dumitrescu, Wolfgang Mulzer, Csaba D. Tóth |
On the Stretch Factor of Polygonal Chains. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Bienkowski, Hsiang-Hsuan Liu |
An Improved Online Algorithm for the Traveling Repairperson Problem on a Line. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou 0001 |
Reconfiguration of Minimum Steiner Trees via Vertex Exchanges. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Parys |
Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Hoàng-Oanh Le, Van Bang Le |
Constrained Representations of Map Graphs and Half-Squares. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Ganty, Elena Gutiérrez, Pedro Valero 0001 |
A Congruence-based Perspective on Automata Minimization Algorithms. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov, Guy Kortsarz, Eli Shalom |
Approximating Activation Edge-Cover and Facility Location Problems. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Murilo Santos de Lima |
Query-Competitive Sorting with Uncertainty. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Leroux |
Petri Net Reachability Problem (Invited Talk). |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Radovan Cervený, Ondrej Suchý |
Faster FPT Algorithm for 5-Path Vertex Cover. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Anselm Haak, Juha Kontinen, Fabian Müller 0003, Heribert Vollmer, Fan Yang 0004 |
Counting of Teams in First-Order Team Logics. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev |
Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Abdulaziz, Kurt Mehlhorn, Tobias Nipkow |
Trustworthy Graph Algorithms (Invited Talk). |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Dusan Knop, Tomás Masarík, Tomás Toufar |
Parameterized Complexity of Fair Vertex Evaluation Problems. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nathan Thomasset |
Nash Equilibria in Games over Graphs Equipped with a Communication Mechanism. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Aubrun, Sebastián Barbieri, Etienne Moutot |
The Domino Problem is Undecidable on Surface Groups. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Konrad 0001, Viktor Zamaraev |
Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kiefer, Cas Widdershoven |
Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Sougata Bose, Shankara Narayanan Krishna, Anca Muscholl, Vincent Penelle, Gabriele Puppis |
On Synthesis of Resynchronizers for Transducers. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Ian Pratt-Hartmann, Lidia Tendera |
The Fluted Fragment with Transitivity. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Jaffke, Paloma T. Lima |
A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Droste, Paul Gastin |
Aperiodic Weighted Automata and Weighted First-Order Logic. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Garlík |
Resolution Lower Bounds for Refutation Statements. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner |
Finding Optimal Solutions With Neighborly Help. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Joel D. Day, Florin Manea, Dirk Nowotka |
Upper Bounds on the Length of Minimal Solutions to Certain Quadratic Word Equations. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon |
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Gupta 0008, Chandan Saha 0001 |
On the Symmetries of and Equivalence Test for Design Polynomials. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Boreale |
On the Coalgebra of Partial Differential Equations. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Ishay Haviv |
Approximating the Orthogonality Dimension of Graphs and Hypergraphs. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul C. Bell, Igor Potapov, Pavel Semukhin |
On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Théodore Lopez, Benjamin Monmege, Jean-Marc Talbot |
Determinisation of Finitely-Ambiguous Copyless Cost Register Automata. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Bessy, Marin Bougeret, R. Krithika 0001, Abhishek Sahu, Saket Saurabh 0001, Jocelyn Thiebaut, Meirav Zehavi |
Packing Arc-Disjoint Cycles in Tournaments. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Avni, Thomas A. Henzinger, Dorde Zikelic |
Bidding Mechanisms in Graph Games. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dixon 0002, Aduri Pavan, N. V. Vinodchandran |
On Pseudodeterministic Approximation Algorithms. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Ninad Rajgopal, Rahul Santhanam, Srikanth Srinivasan 0001 |
Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Aris Pagourtzis, Tomasz Radzik |
Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Bill Fefferman, Shelby Kimmel |
Quantum vs. Classical Proofs and Subset Verification. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi 0001, Subhash Suri |
Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad K. Dabrowski, Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev |
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Akanksha Agrawal 0001, Pallavi Jain 0001, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh 0001 |
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Léo Exibard, Emmanuel Filiot, Ismaël Jecker |
The Complexity of Transducer Synthesis from Multi-Sequential Specifications. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Andre Droschinsky, Nils M. Kriege, Petra Mutzel |
Largest Weight Common Subtree Embeddings with Distance Penalties. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger |
Graph Similarity and Approximate Isomorphism. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Cedric Berenger, Peter Niebert, Kévin Perrot |
Balanced Connected Partitioning of Unweighted Grid Graphs. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Doczkal, Damien Pous |
Treewidth-Two Graphs as a Free Algebra. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Burel |
Linking Focusing and Resolution with Selection. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Louis-Marie Dando, Sylvain Lombardy |
On Hadamard Series and Rotating Q-Automata. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka |
Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Ioannis Lamprou 0001, Russell Martin, Sven Schewe, Ioannis Sigalas, Vassilis Zissimopoulos |
Maximum Rooted Connected Expansion. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Markus L. Schmid |
Consensus Strings with Small Maximum Distance and Small Distance Sum. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim 0002, Michael Lampis |
New Results on Directed Edge Dominating Set. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli |
Pricing Problems with Buyer Preselection. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrea Clementi, Mohsen Ghaffari 0001, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca |
A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Ganardi, Artur Jez, Markus Lohrey |
Sliding Windows over Context-Free Languages. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Ben-Basat, Gil Einziger, Roy Friedman |
Give Me Some Slack: Efficient Network Measurements. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Egor Klenin, Alexander Kozachinskiy |
One-Sided Error Communication Complexity of Gap Hamming Distance. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, Osamu Watanabe 0001 |
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski |
Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikhail V. Berlinkov, Robert Ferens, Marek Szykula |
Complexity of Preimage Problems for Deterministic Finite Automata. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Ryzhikov, Marek Szykula |
Finding Short Synchronizing Words for Prefix Codes. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Droste, Erik Paul |
A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Lutz, Donald M. Stull |
Projection Theorems Using Effective Dimension. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Argyrios Deligkas, Reshef Meir |
Directed Graph Minors and Serial-Parallel Width. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Spyros Angelopoulos 0001, Christoph Dürr, Shendan Jin |
Online Maximum Matching with Recourse. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Gawrychowski, Gad M. Landau, Tatiana Starikovskaya |
Fast Entropy-Bounded String Dictionary Look-Up with Mismatches. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Paul W. Goldberg, Jie Zhang 0008 |
Hardness Results for Consensus-Halving. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Kelin Luo, Thomas Erlebach, Yinfeng Xu |
Car-Sharing between Two Locations: Online Scheduling with Two Servers. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Hugo A. Akitaya, Matthew D. Jones, David Stalfa, Csaba D. Tóth |
Maximum Area Axis-Aligned Square Packings. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Donald M. Stull |
Results on the Dimension Spectra of Planar Lines. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Jonsson, Victor Lagerkvist |
Why are CSPs Based on Partition Schemes Computationally Hard?. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Philipp Schlag, Stefan Walzer |
A Subquadratic Algorithm for 3XOR. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | François Le Gall, Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi |
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Konrad 0001 |
A Simple Augmentation Method for Matchings with Applications to Streaming Algorithms. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Kammer, Andrej Sajenko |
Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann 0002 |
Team Semantics for the Specification and Verification of Hyperproperties. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Dani Dorfman, Haim Kaplan, László Kozma 0002, Uri Zwick |
Pairing heaps: the forward variant. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Hasan Abasi |
Error-Tolerant Non-Adaptive Learning of a Hidden Hypergraph. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Lück |
On the Complexity of Team Logic and Its Two-Variable Fragment. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo D'Arco, Roberto De Prisco, Alfredo De Santis, Angel L. Pérez del Pozo, Ugo Vaccaro |
Probabilistic Secret Sharing. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakub Gajarský, Daniel Král |
Recovering Sparse Graphs. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier |
The Complexity of Finding Small Separators in Temporal Graphs. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos |
Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukas Fleischer, Manfred Kufleitner |
Testing Simon's congruence. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa |
The b-Branching Problem in Digraphs. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Potapov, Paul G. Spirakis, James Worrell 0001 (eds.) |
43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK |
MFCS |
2018 |
DBLP BibTeX RDF |
|
| 1 | Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler |
Shape Recognition by a Finite Automaton Robot. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Florent R. Madelaine, Barnaby Martin |
Consistency for Counting Quantifiers. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Chen Dan 0001, Kristoffer Arnsfelt Hansen, He Jiang, Liwei Wang 0001, Yuchen Zhou |
Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Carayol, Matthew Hague |
Optimal Strategies in Pushdown Reachability Games. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | P. Madhusudan, Dirk Nowotka, Aayush Rajasekaran, Jeffrey O. Shallit |
Lagrange's Theorem for Binary Squares. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Hefetz, Orna Kupferman, Amir Lellouche, Gal Vardi |
Spanning-Tree Games. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Jing Huang 0007, Ross M. McConnell, Arash Rafiey |
Interval-Like Graphs and Digraphs. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Yassine Hamoudi |
Simultaneous Multiparty Communication Protocols for Composed Functions. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessio Conte, Roberto Grossi, Andrea Marino 0001, Romeo Rizzi, Luca Versari |
Listing Subgraphs by Cartesian Decomposition. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license