MFCS - researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 3117

2023

On the Finite Variable-Occurrence Fragment of the Calculus of Relations with Bounded Dot-Dagger AlternationYoshiki Nakamura 0001. mfcs 2023: [doi]

An Iterative Approach for Counting Reduced Ordered Binary Decision DiagramsJulien Clément 0001, Antoine Genitrini. mfcs 2023: [doi]

Competitive Search in the Line and the Star with PredictionsSpyros Angelopoulos 0001. mfcs 2023: [doi]

Inductive Continuity via Brouwer TreesLiron Cohen 0001, Bruno da Rocha Paiva, Vincent Rahli, Ayberk Tosun. mfcs 2023: [doi]

Dynamic Constant Time Parallel Graph Algorithms with Sub-Linear WorkJonas Schmidt 0001, Thomas Schwentick. mfcs 2023: [doi]

On the Work of Dynamic Constant-Time Parallel Algorithms for Regular Tree Languages and Context-Free LanguagesJonas Schmidt 0001, Thomas Schwentick, Jennifer Todtenhoefer. mfcs 2023: [doi]

Rényi-Ulam Games and Online Computation with Imperfect AdviceSpyros Angelopoulos 0001, Shahin Kamali. mfcs 2023: [doi]

Graph Connectivity with Noisy QueriesDimitris Fotakis 0001, Evangelia Gergatsouli, Charilaos Pipis, Miltiadis Stouras, Christos Tzamos. mfcs 2023: [doi]

Modification Problems Toward Proper (Helly) Circular-Arc GraphsYixin Cao 0001, Hanchun Yuan, Jianxin Wang 0001. mfcs 2023: [doi]

Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic GraphsMatthew Johnson 0002, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen. mfcs 2023: [doi]

Fixed-Parameter Algorithms for Fair Hitting Set ProblemsTanmay Inamdar 0002, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh 0001. mfcs 2023: [doi]

Front Matter, Table of Contents, Preface, Conference Organizationmfcs 2023: [doi]

Roman Census: Enumerating and Counting Roman Dominating Functions on Graph ClassesFaisal N. Abu-Khzam, Henning Fernau, Kevin Mann. mfcs 2023: [doi]

Counting Computations with Formulae: Logical Characterisations of Counting Complexity ClassesAntonis Achilleos, Aggeliki Chalki. mfcs 2023: [doi]

Descriptive Complexity for Distributed Computing with CircuitsVeeti Ahvonen, Damian Heiman, Lauri Hella, Antti Kuusisto. mfcs 2023: [doi]

Solving Irreducible Stochastic Mean-Payoff Games and Entropy Games by Relative Krasnoselskii-Mann IterationMarianne Akian, Stéphane Gaubert, Ulysse Naepels, Basile Terver. mfcs 2023: [doi]

The Geometry of Reachability in Continuous Vector Addition Systems with StatesShaull Almagor, Arka Ghosh 0002, Tim Leys, Guillermo A. Pérez 0001. mfcs 2023: [doi]

Multivariate to Bivariate Reduction for Noncommutative Polynomial FactorizationVikraman Arvind, Pushkar S. Joglekar. mfcs 2023: [doi]

Entropic Risk for Turn-Based Stochastic GamesChristel Baier, Krishnendu Chatterjee, Tobias Meggendorfer, Jakob Piribauer. mfcs 2023: [doi]

Speed Me up If You Can: Conditional Lower Bounds on Opacity VerificationJirí Balun, Tomás Masopust, Petr Osicka. mfcs 2023: [doi]

Separating Automatic RelationsPablo Barceló, Diego Figueira, Rémi Morvan. mfcs 2023: [doi]

On the Parameterized Complexity of Computing st-Orientations with Few Transitive EdgesCarla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli. mfcs 2023: [doi]

Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and GeneralizationsNoy Biton, Reut Levi, Moti Medina. mfcs 2023: [doi]

Locality Theorems in Semiring SemanticsClotilde Bizière, Erich Grädel, Matthias Naaf. mfcs 2023: [doi]

A Characterisation of Functions Computable in Polynomial Time and Space over the Reals with Discrete Ordinary Differential Equations: Simulation of Turing Machines with Analytic Discrete ODEsManon Blanc, Olivier Bournez. mfcs 2023: [doi]

MaxCut Above GuaranteeIvan Bliznets, Vladislav Epifanov. mfcs 2023: [doi]

Exploring the Space of Colourings with Kempe Changes (Invited Talk)Marthe Bonamy. mfcs 2023: [doi]

Cryptanalysis of a Generalized Subset-Sum Pseudorandom GeneratorCharles Bouillaguet, Florette Martinez, Damien Vergnaud. mfcs 2023: [doi]

Online Algorithms with Predictions (Invited Talk)Joan Boyar. mfcs 2023: [doi]

The Compositional Structure of Bayesian InferenceDylan Braithwaite, Jules Hedges, Toby St Clere Smithe. mfcs 2023: [doi]

Deterministic Constrained Multilinear DetectionCornelius Brand, Viktoriia Korchemna, Michael Skotnica. mfcs 2023: [doi]

Rational Verification for Nash and Subgame-Perfect Equilibria in Graph GamesLéonard Brice, Jean-François Raskin, Marie van den Bogaard. mfcs 2023: [doi]

On Property Testing of the Binary RankNader H. Bshouty. mfcs 2023: [doi]

Short Definitions in Constraint LanguagesJakub Bulín, Michael Kompatscher. mfcs 2023: [doi]

The Online Simple Knapsack Problem with Reservation and RemovabilityElisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith. mfcs 2023: [doi]

Parikh One-Counter AutomataMichaël Cadilhac, Arka Ghosh, Guillermo A. Pérez 0001, Ritam Raha. mfcs 2023: [doi]

Isometric Path Complexity of GraphsDibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès. mfcs 2023: [doi]

Support Size Estimation: The Power of ConditioningDiptarka Chakraborty, Gunjan Kumar, Kuldeep S. Meel. mfcs 2023: [doi]

Query Complexity of Search ProblemsArkadev Chattopadhyay, Yogesh Dahiya, Meena Mahajan. mfcs 2023: [doi]

Tight Algorithmic Applications of Clique-Width GeneralizationsVera Chekan, Stefan Kratsch. mfcs 2023: [doi]

Modern Parallel Algorithms (Invited Talk)Artur Czumaj. mfcs 2023: [doi]

Approximating the Value of Energy-Parity Objectives in Simple Stochastic GamesMohan Dantam, Richard Mayr. mfcs 2023: [doi]

Dynamic Planar Embedding Is in DynFOSamir Datta, Asif Khan, Anish Mukherjee 0001. mfcs 2023: [doi]

Universality and Forall-Exactness of Cost Register Automata with Few RegistersLaure Daviaud, Andrew Ryzhikov. mfcs 2023: [doi]

Relaxed Core Stability for Hedonic Games with Size-Dependent UtilitiesTom Demeulemeester, Jannik Peters 0001. mfcs 2023: [doi]

Recontamination Helps a Lot to Hunt a RabbitThomas Dissaux, Foivos Fioravantes, Harmender Gahlawat, Nicolas Nisse. mfcs 2023: [doi]

String Diagrammatic Trace TheoryMatthew Earnshaw, Pawel Sobocinski 0001. mfcs 2023: [doi]

Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NPFabian Egidy, Christian Glaßer, Martin Herold. mfcs 2023: [doi]

Finding a Highly Connected Steiner Subgraph and its ApplicationsEduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan 0001. mfcs 2023: [doi]

FPT Approximation and Subexponential Algorithms for Covering Few or Many EdgesFedor V. Fomin, Petr A. Golovach, Tanmay Inamdar 0002, Tomohiro Koana. mfcs 2023: [doi]

Positive Data LanguagesFlorian Frank, Stefan Milius, Henning Urbat. mfcs 2023: [doi]

Parameterized Analysis of the Cops and Robber GameHarmender Gahlawat, Meirav Zehavi. mfcs 2023: [doi]

Distributed Merlin-Arthur Synthesis of Quantum States and Its ApplicationsFrançois Le Gall, Masayuki Miyamoto, Harumichi Nishimura. mfcs 2023: [doi]

An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-WidthLuisa Gargano, Adele A. Rescigno. mfcs 2023: [doi]

Depth-3 Circuits for Inner ProductMika Göös, Ziyi Guan, Tiberiu Mosnoi. mfcs 2023: [doi]

On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract)Christoph Haase, Alessio Mansutti, Amaury Pouly. mfcs 2023: [doi]

The Covering Canadian Traveller Problem RevisitedNiklas Hahn, Michalis Xefteris. mfcs 2023: [doi]

On the Complexity of Computing Time Series Medians Under the Move-Split-Merge MetricJana Holznigenkemper, Christian Komusiewicz, Nils Morawietz, Bernhard Seeger. mfcs 2023: [doi]

Parameterized Approximation Scheme for Feedback Vertex SetSatyabrata Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai 0001, Saket Saurabh 0001. mfcs 2023: [doi]

Sliding into the Future: Investigating Sliding Windows in Temporal Graphs (Invited Talk)Nina Klobas, George B. Mertzios, Paul G. Spirakis. mfcs 2023: [doi]

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two MatroidsYasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa. mfcs 2023: [doi]

Formalizing Hyperspaces for Extracting Efficient Exact Real ComputationMichal Konecný, Sewon Park 0001, Holger Thies. mfcs 2023: [doi]

Set Semantics for Asynchronous TeamLTL: Expressivity and ComplexityJuha Kontinen, Max Sandström, Jonni Virtema. mfcs 2023: [doi]

Algebraic Reasoning for (Un)Solvable Loops (Invited Talk)Laura Kovács. mfcs 2023: [doi]

Parameterized Complexity of Domination Problems Using Restricted Modular PartitionsManuel Lafond, Weidong Luo. mfcs 2023: [doi]

Parameterized Max Min Feedback Vertex SetMichael Lampis, Nikolaos Melissinos, Manolis Vasilakis. mfcs 2023: [doi]

48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, FranceJérôme Leroux, Sylvain Lombardy, David Peleg, editors, Volume 272 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded RadiusFelicia Lucke, Daniël Paulusma, Bernard Ries. mfcs 2023: [doi]

A Weyl Criterion for Finite-State Dimension and ApplicationsJack H. Lutz, Satyadev Nandakumar, Subin Pulari. mfcs 2023: [doi]

On the Complexity Dichotomy for the Satisfiability of Systems of Term Equations over Finite AlgebrasPeter Mayr. mfcs 2023: [doi]

Parallel Enumeration of Parse TreesMargarita Mikhelson, Alexander Okhotin. mfcs 2023: [doi]

Spartan Bipartite Graphs Are Essentially ElementaryNeeldhara Misra, Saraswati Girish Nanoti. mfcs 2023: [doi]

Effective Continued Fraction Dimension Versus Effective Hausdorff Dimension of RealsSatyadev Nandakumar, Akhil S, Prateek Vishnoi. mfcs 2023: [doi]

On the Expressive Power of Regular Expressions with BackreferencesTaisei Nogami, Tachio Terauchi. mfcs 2023: [doi]

OBDD(Join) Proofs Cannot Be BalancedSergei Ovcharov. mfcs 2023: [doi]

Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-CircuitsBenedikt Pago. mfcs 2023: [doi]

A Super-Polynomial Separation Between Resolution and Cut-Free Sequent CalculusTheodoros Papamakarios. mfcs 2023: [doi]

Deciding Predicate Logical Theories Of Real-Valued FunctionsStefan Ratschan. mfcs 2023: [doi]

A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal GraphsGuozhen Rong, Yongjie Yang 0001, Wenjun Li 0001. mfcs 2023: [doi]

Probabilistic Input-Driven Pushdown AutomataAlex Rose, Alexander Okhotin. mfcs 2023: [doi]

Realizing Finitely Presented Groups as Projective Fundamental Groups of SFTsLéo Paviet Salomon, Pascal Vanier. mfcs 2023: [doi]

Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical CharacterisationBenjamin Scheidt, Nicole Schweikardt. mfcs 2023: [doi]

Logical Equivalences, Homomorphism Indistinguishability, and Forbidden MinorsTim Seppelt. mfcs 2023: [doi]

Decomposing Finite LanguagesDaniel Alexander Spenner. mfcs 2023: [doi]

Dependent k-Set Packing on PolynomoidsMeng-Tsung Tsai, Shi-Chun Tsai, Tsung Ta Wu. mfcs 2023: [doi]

Exponential Lower Bounds for Threshold Circuits of Sub-Linear Depth and EnergyKei Uchizawa, Haruki Abe. mfcs 2023: [doi]

Exact and Approximation Algorithms for Routing a Convoy Through a GraphMartijn van Ee, Tim Oosterwijk, René Sitters, Andreas Wiese. mfcs 2023: [doi]

Ordinal Measures of the Set of Finite MultisetsIsa Vialard. mfcs 2023: [doi]

Checking Presence Reachability Properties on Parameterized Shared-Memory SystemsNicolas Waldburger. mfcs 2023: [doi]

Recognizing H-Graphs - Beyond Circular-Arc GraphsDeniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman 0003. mfcs 2023: [doi]

2022

Comonadic semantics for hybrid logicSamson Abramsky, Dan Marsden. mfcs 2022: [doi]

Algebraic Representations of Unique Bipartite Perfect MatchingGal Beniamini. mfcs 2022: [doi]

Continuous Rational Functions Are Deterministic RegularOlivier Carton, Gaëtan Douéneau-Tabot. mfcs 2022: [doi]

Enumeration Classes Defined by CircuitsNadia Creignou, Arnaud Durand 0001, Heribert Vollmer. mfcs 2022: [doi]

Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query TimesDariusz Dereniowski, Izajasz P. Wrosz. mfcs 2022: [doi]

On the Identity Problem for Unitriangular Matrices of Dimension FourRuiwen Dong. mfcs 2022: [doi]

A Robust Class of Languages of 2-Nested WordsSéverine Fratani, Guillaume Maurras, Pierre-Alain Reynier. mfcs 2022: [doi]

Streaming Word ProblemsMarkus Lohrey, Lukas Lück. mfcs 2022: [doi]

Space-Bounded Unitary Quantum Computation with PostselectionSeiichiro Tani. mfcs 2022: [doi]

Cohomology in Constraint Satisfaction and Structure IsomorphismAdam Ó Conghaile. mfcs 2022: [doi]

Links

Filter by Year

[-]
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1

MFCS (mfcs)

Viewing Publication 1 - 100 from 3117

2023

2022

Links

Filter by Year [-]OR AND NOT 1

Filter by Tag [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top terms [+]OR AND NOT 1

MFCS (mfcs)

Viewing Publication 1 - 100 from 3117

2023

2022

Filter by Year

[-]
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1