| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Susanne Albers, Arindam Khan 0001, Leon Ladewig |
Best Fit Bin Packing with Random Order Revisited.  |
MFCS  |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay |
A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Emirhan Gürpinar, Andrei E. Romashchenko |
Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Jaffke, Mateus de Oliveira Oliveira, Hans Raj Tiwary |
Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Mary Wootters |
List-Decodability of Structured Ensembles of Codes (Invited Talk). |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann |
Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Palash Dey, Jaikumar Radhakrishnan, Santhoshini Velusamy |
Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikhail Rubinchik, Arseny M. Shur |
Palindromic k-Factorization in Pure Linear Time. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Rabinovich, Doron Tiferet |
Ambiguity Hierarchy of Regular Infinite Tree Languages. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese Biedl, Steven Chaplick, Michael Kaufmann 0001, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou |
Layered Fan-Planar Graph Drawings. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Böhm 0001, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon 0001 |
Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Kim Thang Nguyen |
An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence Constraints. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Michielini, Michal Skrzypczak |
Regular Choice Functions and Uniformisations For countable Domains. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Javier Esparza, Daniel Král' (eds.) |
45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic. |
MFCS |
2020 |
DBLP BibTeX RDF |
|
| 1 | Alessio Conte, Pierluigi Crescenzi, Andrea Marino 0001, Giulia Punzi |
Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Paszke, Michal Pilipczuk |
VC Density of Set Systems Definable in Tree-Like Graphs. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Chetan Gupta 0002, Vimal Raj Sharma, Raghunath Tewari |
Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Louis Parlant, Jurriaan Rot, Alexandra Silva 0001, Bas Westerbaan |
Preservation of Equations by Monoidal Monads. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum |
A Polynomial Kernel for 3-Leaf Power Deletion. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Arjan Cornelissen, Stacey Jeffery, Maris Ozols, Alvaro Piedrafita |
Span Programs and Quantum Time Complexity. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Arindam Biswas 0001, Venkatesh Raman 0001, Saket Saurabh 0001 |
Approximation in (Poly-) Logarithmic Space. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev |
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Matthew J. Katz, Elad Sulami |
Dynamic Time Warping-Based Proximity Problems. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ignasi Sau, Uéverton dos Santos Souza |
Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Paloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen |
Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Orna Kupferman, Ofer Leshkowitz |
On Repetition Languages. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Max Bannach, Sebastian Berndt 0001, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath |
Solving Packing Problems with Few Small Items Using Rainbow Matchings. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Linker, Fabio Papacchini, Michele Sevegnani |
Analysing Spatial Properties on Neighbourhood Spaces. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen 0001, Juris Smotrovs, Jevgenijs Vihrovs |
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuhiro Kurita, Yasuaki Kobayashi |
Efficient Enumerations for Minimal Multicuts and Multiway Cuts. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala |
On a Temporal Logic of Prefixes and Infixes. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Konecný, Florian Steinberg 0001, Holger Thies |
Continuous and Monotone Machines. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Petra Wolf 0002, Tomoyuki Yamakami |
Synchronizing Deterministic Push-Down Automata Can Be Really Hard. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Béaur, Jarkko Kari |
Decidability in Group Shifts and Group Cellular Automata. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Pranabendu Misra, Fahad Panolan, Ashutosh Rai 0001, Saket Saurabh 0001, Roohani Sharma |
Quick Separation in Chordal and Split Graphs. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Rastislav Královic, Richard Královic, Dana Pardubská, Martin Pasen, Peter Rossmanith |
Randomization in Non-Uniform Finite Automata. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor |
Topological Influence and Locality in Swap Schelling Games. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Junhao Gan, David F. Gleich, Nate Veldt, Anthony Wirth, Xin Zhang 0094 |
Graph Clustering in All Parameter Regimes. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Jaffke, Paloma T. Lima, Geevarghese Philip |
Structural Parameterizations of Clique Coloring. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandre Clément, Simon Perdrix |
PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Hirai 0001, Ryuhei Mizutani |
Minimum 0-Extension Problems on Directed Metrics. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos |
The Complexity of Approximating the Complex-Valued Potts Model. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Ganty, Elena Gutiérrez, Pedro Valero 0001 |
A Quasiorder-Based Perspective on Residual Automata. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Satyadev Nandakumar, Prateek Vishnoi |
Randomness and Effective Dimension of Continued Fractions. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Lohrey, Georg Zetzsche |
Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Gaëtan Douéneau-Tabot, Emmanuel Filiot, Paul Gastin |
Register Transducers Are Marble Transducers. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Dhawal Jethwani, François Le Gall, Sanjay Kumar Singh |
Quantum-Inspired Classical Algorithms for Singular Value Transformation. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg |
Extending Nearly Complete 1-Planar Drawings in Polynomial Time. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Dietrich Kuske, Christian Schwarz |
Complexity of Counting First-Order Logic for the Subword Order. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Rian Neogi, M. S. Ramanujan 0001, Saket Saurabh 0001, Roohani Sharma |
On the Parameterized Complexity of Deletion to ℋ-Free Strong Components. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Yury Elkin, Vitaliy Kurlin |
The Mergegram of a Dendrogram and Its Stability. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Neider, Patrick Totzke, Martin Zimmermann 0002 |
Optimally Resilient Strategies in Pushdown Safety Games. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Deniz Agaoglu, Petr Hlinený |
Isomorphism Problem for S_d-Graphs. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Arnaud Labourel, Sébastien Ratel |
Distance Labeling Schemes for Cube-Free Median Graphs. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandra Kiefer, Daniel Neuen |
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin 0001, Przemyslaw Uznanski |
RLE Edit Distance in Near Optimal Time. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Ziyuan Gao, Sanjay Jain 0001, Bakhadyr Khoussainov, Wei Li 0050, Alexander G. Melnikov, Karen Seidel 0001, Frank Stephan 0001 |
Random Subgroups of Rationals. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov |
Picking Random Vertices (Invited Talk). |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Titouan Carette, Dominic Horsman, Simon Perdrix |
SZX-Calculus: Scalable Graphical Quantum Reasoning. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Bournez, Arnaud Durand 0001 |
Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | C. Ramya, B. V. Raghavendra Rao |
Lower Bounds for Multilinear Order-Restricted ABPs. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz |
From Regular Expression Matching to Parsing. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Böker, Yijia Chen, Martin Grohe, Gaurav Rattan |
The Complexity of Homomorphism Indistinguishability. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul C. Bell, Mika Hirvensalo |
Acceptance Ambiguity for Quantum Automata. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther Galby, Paloma T. Lima, Bernard Ries |
Reducing the Domination Number of Graphs via Edge Contractions. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuel Kieronski |
One-Dimensional Guarded Fragments. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Erich Grädel, Svenja Schalthöfer |
Choiceless Logarithmic Space. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Bruno Escoffier, Alexandre Teiller |
Multistage Knapsack. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen (eds.) |
44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany. |
MFCS |
2019 |
DBLP BibTeX RDF |
|
| 1 | Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi 0001, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa |
The Perfect Matching Reconfiguration Problem. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Athanasios L. Konstantinidis, Charis Papadopoulos |
Cluster Deletion on Interval Graphs and Split Related Graphs. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Berkholz, Nicole Schweikardt |
Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular Width. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Lagerkvist, Gustav Nordh |
On the Strength of Uniqueness Quantification in Primitive Positive Formulas. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Lohrey, Armin Weiß |
The Power Word Problem. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Amirhossein Kazeminia, Andrei A. Bulatov |
Counting Homomorphisms Modulo a Prime Number. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Eva Fluck |
Tangles and Single Linkage Hierarchical Clustering. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Clairambault, Andrzej S. Murawski |
On the Expressivity of Linear Recursion Schemes. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Sankardeep Chakraborty, Kunihiko Sadakane |
Indexing Graph Search Trees and Applications. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Danielski, Emanuel Kieronski |
Finite Satisfiability of Unary Negation Fragment with Transitivity. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Christian Coester, Lukasz Jez, Elias Koutsoupias |
Better Bounds for Online Line Chasing. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Akanksha Agrawal 0001, Pallavi Jain 0001, Lawqueen Kanesh, Saket Saurabh 0001 |
Parameterized Complexity of Conflict-Free Matchings and Paths. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Mathieu Hoyrup, Donald M. Stull |
Semicomputable Points in Euclidean Spaces. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Vladimir V. Gusev, Stefan Hoffmann 0001, Markus Holzer 0001, Mikhail V. Volkov 0001, Petra Wolf 0002 |
Computational Complexity of Synchronization under Regular Constraints. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Erhard Aichinger |
Solving Systems of Equations in Supernilpotent Algebras. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Carl Einarson, Felix Reidl |
Domination Above r-Independence: Does Sparseness Help? |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Dennunzio, Enrico Formenti, Darij Grinberg, Luciano Margara |
Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino 0001, Takeaki Uno, Kunihiro Wasa |
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Florent Koechlin, Cyril Nicaud, Pablo Rotondo |
Uniform Random Expressions Lack Expressivity. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Julian Dörfler, Marc Roth, Johannes Schmitt 0002, Philip Wellnitz |
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Shiv Kumar Gupta 0001, Ayush Tulsyan |
Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Stanislav Zivný |
Approximate Counting CSP Seen from the Other Side. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Diego Figueira, Varun Ramanathan 0001, Pascal Weil |
The Quantifier Alternation Hierarchy of Synchronous Relations. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandra Silva 0001 |
Guarded Kleene Algebra with Tests: Verification of Uninterpreted Programs in Nearly Linear Time (Invited Talk). |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Barnaby Martin, Daniël Paulusma, Siani Smith |
Colouring H-Free Graphs of Bounded Diameter. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi |
A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Wojciech Czerwinski, Slawomir Lasota 0001, Christof Löding, Radoslaw Piórkowski |
New Pumping Technique for 2-Dimensional VASS. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathan Lhote, Vincent Michielini, Michal Skrzypczak |
Uniformisation Gives the Full Strength of Regular Languages. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova |
Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Anantha Padmanabha, R. Ramanujam 0001 |
Two variable fragment of Term Modal Logic. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license