yusuke1997/dblp-id-title huggingface dataset:
Compact Representation of Graphs of Small Clique-Width
Guest Editors' Introduction to the Special Issue on Graph Drwaing
Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs
Average-Case Approximation Ratio of Scheduling without Payments
Counting and Generating Permutations in Regular Classes
Publisher Correction: Longest Common Substring with Approximately k Mismatches
Analysis of the (1+1) EA on LeadingOnes with Constraints
Random and Conditional (t, k)-Diagnosis of Hypercubes
Maximum Induced Matchings for Chordal Graphs in Linear Time
Complexity Framework for Forbidden Subgraphs I: The Framework
Improving an Algorithm for Approximate Pattern Matching
Guest Editor's Foreword: Special Issue on String Algorithmics and Its Applications
On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets
A Theoretical Framework for Simulated Annealing
A New Characterization of P k -Free Graphs
BSP versus LogP
Stable Matchings, One-Sided Ties, and Approximate Popularity
Polygonal Representations of Digital Sets
On Sorting, Heaps, and Minimum Spanning Trees
Ranking-Based Black-Box Complexity
Editor's Note: Special Issue Dedicated to the 60th Birthday of Gregory Gutin
Improved Generic Attacks Against Hash-Based MACs and HAIFA
Randomized Quickhull
A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation
A New Approximation Algorithm for Finding Heavy Planar Subgraphs
On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth
Adaptive AIMD Congestion Control
Optimal Mutation Rates for the (1+λ) EA on OneMax Through Asymptotically Tight Drift Analysis
Constructing Tree-Child Networks from Distance Matrices
Guest Editorial: Computing and Combinatorics
Correction to: Counting Minimum Weight Arborescences
Multidimensional Cube Packing
Best-of-Both-Worlds Analysis of Online Search
Constant-Degree Graph Expansions that Preserve Treewidth
Sampling Conformation Space to Model Equilibrium Fluctuations in Proteins
Boosting Double Coverage for k-Server via Imperfect Predictions
Efficient Algorithms for Dynamic Allocation of Distributed Memo
On the Competitive Theory and Practice of Online List Accessing Algorithms
A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem
Non-clairvoyantly Scheduling to Minimize Convex Functions
Tree-Based Parallel Algorithm Design
Average-Case Analysis for a Simple Compression Algorithm
A Time Bound on the Materialization of Some Recursively Defined Views
An O(n 2 ) Algorithm for the Limited-Capacity Many-to-Many Point Matching in One Dimension
Testing Homotopic Routability Under Polygonal Wiring Rules
Strongly Polynomial FPTASes for Monotone Dynamic Programs
Dynamic Fractional Cascading
Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems
Pattern Matching for Sets of Segments
Sorting-Based Selection Algorithms for Hypercubic Networks
Energy-Optimal Routes for Battery Electric Vehicles
Minimizing Latency of Capacitated k-Tours
Another Sub-exponential Algorithm for the Simple Stochastic Game
Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem
An Algorithm Reminiscent of Euclidean-gcd Computing a Function Related to Pinwheel Scheduling
The Solution of Linear Probabilistic Recurrence Relations
Fast Polynomial-Space Algorithms Using Inclusion-Exclusion
Analysis of Noisy Evolutionary Optimization When Sampling Fails
Bounded Space On-Line Bin Packing: Best Is Better than First
Optimal Time-Critical Scheduling via Resource Augmentation
Efficient Algorithms for Block-Cyclic Redistribution of Arrays
Gaming Prediction Markets: Equilibrium Strategies with a Market Maker
The Rectilinear Steiner Arborescence Problem
Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights
Erratum to: A Grouping Approach for Succinct Dynamic Dictionary Matching
An Efficient Distributed Algorithm for Maximum Matching in General Graphs
Efficient Parallel and Sequential Algorithms for 4-Coloring Perfect Planar Graphs
A Robust Model for Finding Optimal Evolutionary Trees
A Constant Factor Approximation Algorithm for the Storage Allocation Problem
A Connection Between Sports and Matroids: How Many Teams Can We Beat?
The General Maximum Matching Algorithm of Micali and Vazirani
An Efficient Exhaustive Search Algorithm for the Escherization Problem
Set It and Forget It: Approximating the Set Once Strip Cover Problem
A Workbench for Computational Geometry
Preface of the Special Issue Dedicated to Selected Papers from IWOCA 2022
Linear-Space Algorithms that Build Local Alignments from Fragments
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes
Exponential Lower Bounds on the Complexity of a Class of Dynamic Programs for Combinatorial Optimization Problems
Partitioning a Weighted Tree into Subtrees with Weights in a Given Range
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP
Aggregation of Partial Rankings, p -Ratings and Top- m Lists
Stackelberg Strategies for Selfish Routing in General Multicommodity Networks
Budget Management with Applications
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II
Symmetry Breaking in the Plane
Shortest Paths in Euclidean Graphs
Geometric Applications of a Matrix-Searching Algorithm
Approximate Minimum Weight Matching on Points in k-Dimensional Space
Delay Optimization in Quorum Consensus
Orthogonal Queries in Segments
More Precise Runtime Analyses of Non-elitist Evolutionary Algorithms in Uncertain Environments
Erratum to: Conflict-Free Chromatic Art Gallery Coverage
Computing L 1 Shortest Paths Among Polygonal Obstacles in the Plane
Reconstructing a Minimum Spanning Tree after Deletion of Any Node
On Rooted Node-Connectivity Problems
Two-Way and Multiway Partitioning of a Set of Intervals for Clique-Width Maximization
Finding a Closest Visible Vertex Pair Between Two Polygons
Streaming Algorithms for Independent Sets in Sparse Hypergraphs
Diameter and Treewidth in Minor-Closed Graph Families
A Framework for Adversarial Streaming Via Differential Privacy and Difference Estimators
The Contraction Method for Recursive Algorithms
On the Complexity of Compressing Two Dimensional Routing Tables with Order
Approximation Schemes for the Generalized Extensible Bin Packing Problem
Complexity Results for Throughput and Latency Optimization of Replicated and Data-parallel Workflows
A Tree Traversal Algorithm for Decision Problems in Knot Theory and 3-Manifold Topology
Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane
Matching Regular Expressions on uncertain data
Coding Techniques for Handling Failures in Large Disk Arrays
Decomposition of a Three-Dimensional Discrete Object Surface into Discrete Plane Pieces
Area Minimization for Hierarchical Floorplans
A Lower Bound on the Probability of Conflict Under Nonuniform Access in Database Systems
On the Computational Complexity of Measuring Global Stability of Banking Networks
A Generic Algorithm for One-Dimensional Homotopic Compaction
An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains
Determining Basic Variables of Optimal Solutions in Karmarkar's New LP Algorithm
Representing Trees of Higher Degree
Solving Systems of Difference Constraints Incrementally with Bidirectional Search
Modeling Parallel Bandwidth: Local versus Global Restrictions
Numerical Stability of a Convex Hull Algorithm for Simple Polygons
An Optimal Parallel Algorithm for Planar Cycle Separators
Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions
Steiner Minimal Trees with One Polygonal Obstacle
Pricing for Fairness: Distributed Resource Allocation for Multiple Objectives
Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds
Local Computation Algorithms for Graphs of Non-constant Degrees
Max-3-Lin Over Non-abelian Groups with Universal Factor Graphs
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
Issues in Computing Contact Forces for Non-Penetrating Rigid Bodies
Average Case Analysis of Disk Scheduling, Increasing Subsequences and Spacetime Geometry
On Robustness of Forward-looking in Sponsored Search Auction
Approximations for a Bottleneck Steiner Tree Problem
Shorthand Universal Cycles for Permutations
On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
Lempel-Ziv-Like Parsing in Small Space
Report from EATCS Japan Chapter
How to Transfer Concepts of Abstract Data Types to Petri Nets?
EATCS Distinguished Dissertation Award 2016 - Call for Nominations
Inside the Simons Institute
The Algebraic Specification Column
Report on UCNC 2016
Report on BCTCS 2014
Letter from the Bulletin Editor
On rough sets
Thirty Years of Collaboration with Jan van Leeuwen: In Search of Understanding Computation
Expressive power of Constraint Handling Rules extensions and fragments
Data Streams and Applications in Computer Science
Foreword to the contributions by two EATCS award-recipients
Pairwise Testing
Critical factorizations of words
Letter from the President
On minimizing finite automata
The Presburger Award 2018 - Laudatio for Aleksander Madry
Natural Data Mining Techniques
Exploring the Borderlands of the Gathering Problem
Decidability in finite automata
Selfish Task Allocation
Tribute to Arto Salomaa
A further link between formal languages and complexity theory
Analysis of Algorithms (AofA): Part I: 1993 -- 1998
Researching the Complexity of Boolean Functions with Computers
Report on StringMasters 2013
Are There Natural Problems with Speedup?
The Computational Power of Compiling C++
CONCUR through time
Theory on the Tracks: A Selection of Railway Optimization Problems (Column: Algorithmics)
Deriving Labelled Transition Systems - A Structural Approach
Report on IWRS 2018
Bigraphs meet Double Pushouts
Reverse Twin Shuffles
Context-free Languages are Not Closed under Interior and Frontier
Embedded Finite Models
Morphisms and rational tranducers
Kolmogorov Complexity and Games
Data Compression Meets Automata Theory
Report on CPM 2022
Beyond Turing Machines
Essentials of Finitely Supported Structures
Amalgamation and Extension in the Framework of Specification Logics and Generalized Morphisms
Interval Temporal Logics: a Journey
On the Universality of P Systems with Membrane Creation
Demystifying coding for schools - what are we actually trying to teach?
Cooperating/Distributed Grammar Systems: a Link between Formal Languages and Artificial Intelligence
Maximization versus Minimization in Some Optimization Problems
Hadwiger's Conjecture for some hereditary classes of graphs: a survey
Invariant-Free Deduction Systems for Temporal Logic
A simple lamda-term representing the predecessor function with respect to church numerials
A Quest for Structure in Complexity
EATCS-IPEC Nerode Prize 2019 - Call for Nominations
EATCS Fellows 2021 - Call for Nominations
Unique decomposition of processes
The Gödel Prize 2014 - Call for Nominations
The computational Geometry Column
A Bit of Multimedia Retrieval Algorithmics
Interview with Rajeev Alur and David Dill 2016 Alonzo Church Award Recipients
Theory and Applications of Probabilistic Kolmogorov Complexity
A note on the closure of EDL-languages under erasing homomorphisms
On Formal Semantics and Integration of Object-Oriented Modeling Languages
Foundations of Finite Symbolic Tree Transducers
Quasiperiodic Infinite Words: Some Answers (Column: Formal Language Theory)
Complexity of non-monotonic logics
Why Evolutionary Algorithms
What Lies Beyond the Mountains?
A Note on Restricted Insertion-Deletion Systems
Report on ICALP 2021
An overview of conjunctive grammars, Formal Language Theory Column
Logo Environments in the Focus of Time
Quantum Pseudo-Telepathy Saves the World
Report on ICTCS 2015
Two (infinite?) hierarchies of vector languages
Some Applications of General Topology To The Semantics of Logic Programms
Some Polynomials Related to the Fibonacci Polynomials
Some Remarks on Conservative Extensions: A Socratic Dialogue
Zoltan Esik (1951-2016) In Memoriam
Digital search trees and basic hypergeometric functions
EATCS Award 2015
Book Introduction by the Authors: Profinite Semigroups and Symbolic Dynamic
Addendum to: Finite Variable Logics
Conservative Extension in Structural Operational Semantics
Report on ICALP 2016
EATCS Distinguished Dissertation Award 2015 - Call for Nominations
The Domino Problem of the Hyperbolic Plane is Undecidable
Some analytic techniques for the investigation of the asymptotic behaviour of tree parameters
Report on TIME 2013
Sparse Integer Programming is FPT
Automata and Formal Languages: Shall we let them go?
Report on BCTCS 2013
Does Concurrency Theory Have Anything To Say About Parallel Programming?
Well quasi-ordering in a paper by Maurice Janet
Scientific colloquium in honor of former EATCS President Burkhard Monien on the occasion of his 80th birthday
An Introduction to Probabilistic Automata
Recent Developments in Explicit Constructions of Extractors
Passages of Proof
Decidability issues for infinite-state processes- a survey
Logical foundations: Personal perspective
A responce to "A complete axiomatisation for full join dependencies in relations"
Enumeration Complexity
ICALP 2019 - First Call for Papers
Zdzislaw Pawlak (1926-2006)
The EATCS Award 2015 - Call for Nominations
O = square
Newman's lemma - a case study in proof automation and geometric logic, Logic in Computer Science Column
Negative probabilities, II What they are and what they are for
Zeros of Riemann's Zeta Function are Uniformly Distributed, but not Random: An Answer to Calude's Open Problem
Relationships between depth of deterministic and nondeterministic acyclic programs computing functions of k-valued logic
A Minimal Instruction Set for Education
A rough set approach to real-time state identification
A non-invertible PCF language
Remark on shuffle indentities
L Codes and L Systems with Immigration
Stability in Routing: Networks and Protocols
A Note on Parallel Rewriting in P Systems
The Tower-of-Babel Problem, and Security Assesment Sharing
Explicit Graphs with Extension Properties
Zeros of Z-rational Sequences and Thin 0L Languages
Approximation of Polygons by Rechtangles and Circles
Report on ICTCS 2016
Spiking Neural P Systems: A Tutorial
Automata on infinite trees and Kleene closure of regular tree sets
Integer Multiplicaton and the Complexity of Binary Decision Diagrams
Threshold Phenomena: The Computer Scientist's Viewpoint
Recognizable sets of finite bilabelled transition systems
Improved Results about Universality of P systems
Counting Hierarchies: Polynomial Time and Constant
Recent progress on scaling algorithms and applications
Momories of ADJ
A Short History of Computational Complexity
2022 Alonzo Church Award for Outstanding Contributions to Logic and Computation
Construction and Verification of Performance and Reliability Models
Viewpoints on "Logic activities in Europe", twenty years later
Quasi-Metrics and Fixed Points in Computing
Book Introduction by the Author: Semantics of Probabilistic Processes An Operational Approach
Some applications of the interchange lemma
An Optimal Algorithm for building the Boyer-Moore automaton
George Dantzig: father of the simplex method
Conservative extensions: a cautionary note
Near-Additive Spanners and Near-Exact Hopsets, A Unified View
Report from the Japanese Chapter
Algebreic Programming in Opal
Bringing Informatics Concepts to Children Through Solving Short Tasks
Classification of Petri Nets Using Adjoint Functors
Petr Hajek, 1940-2016
Report on ICTCS 2017
EATCS-Fellows 2022
Temporal Logics for Games
EATCS Fellows 2016 - Call for Nominations
The Presburger Award for Young Scientists 2020 - Call for Nominations
Report on The EATCS General Assembly
On the Existence of a Finite Base for Complete Trace Equivalence over BPA with Interrupt
Lock-Free Locks
Report on BCTCS 2015
On The Graph Accessibility Problem for Directed Graphs of Bounded Degree
Transactional Memory: A Primer for Theorists
E. W. Beth Dissertation Prize 2015 - Call for Nominations
Analog and Hybrid Computation: Dynamical Systems and Programming Languages
Algorithms for Integer Programming
Structure in the Kolakoski Sequence
A note on DTOL Systems
Parallel Communicating Systems
Theory and Practice of Software Development: A Review of Driving Forces and Expectations
remarks concering self reading sequences
The Role of Mathematics and Formal Specification Techniques in Software System Development
Presburger Award 2023 - Laudatio
Some Open Problems Related to Quantum Computing
The Presburger Award 2013: Call for Nominations
The non-computability of computability
First-order Topology Properties
Remarks: The Origin of Quorum Systems
Seven Ways of Deciding Whether Most Vertex Sets Cover a Graph
The Presburger Award for Young Scientists 2019 - Call for Nominations
Worst-Case Upper Bounds for kSAT (Column: Algorithmics)
Evaluation of Tools for the Analysis of Communicating Systems
Possibility Tracking: A Simple Technique for Machine-verifying Lock-free Data Structures
An Introductory Tutorial to Concurrency-Related Distributed Recursion
Ironic Complicity: Satisfiability Algorithms and Circuit Lower Bounds
Machines of Systems Biology
A Normal form for P-Systems
Artificial Chemistries
Games played on the plane: Solitaire and Cellular Automata
Physical Experiments as Oracles
The Computational Geometry Column
Can inductive proofs be automated?
Some results about Logspace complexity measures
Minimal Requirements for Bit-Dissemination with Passive Communication
Why Sets? (Column: Logic in Computer Science)
The Goedel Prize 2023 - Call for Nominations
From Reversible Logic Gates to Universal Quantum Bases
Comments on "Threads in the Theory of Codes" by J. Berstel and D. Perrin
Duality and De Morgan Laws for the Algebra of Lists
Non-centralized parallel communicating grammar systems
Generalized Quantifiers
Computing with Advice: when Knowledge Helps
Some comments about notations of orders of manitude
News from New Zealand
The formal language theory column
Parial order semantics for refinement of actions - neither necessary nor always sufficient but appropriate when used with care
A formal basis for extending SQL to object-oriented databases
H-Colorings of Graphs
Some New Results on Post Correspondence Problem and Its Modifications
Means-fit Effectivity
Report on ICALP 2014
On Minimizing Finite Automata
Concurrency versus interleaving: an instructuve example
Note on Ehrenfeucht's conjecture and Hilbert's basis theorem
Selected Papers from the 1st Workshop "Logic, Language, and Information"
Towards an algebraic specification framework for the VLSI design process
On the decidability of quasi-reducibility
EATCS Distinguished Dissertation Award 2022 - Call for Nominations
Goedel Prize 2021
Interviews with the 2020 CONCUR Test-of-Time Award Recipients
Monogenous FIFO-nets and PETRI-nets are equivalent
Report from ICTCS 2013
A note on the polynomial-time hierarchy and the quantified Boolean formulas
A Conjecture on the Error Bound of the Barycenter Heuristic
Algorithms: A Quest for Absolute Definitions
Abstract State Machines 1988-1998: Commented ASM Bibliography
Know the Person behind the Papers: Mariangiola Dezani-Ciancaglini
The EATCS Award 2022 - Call for Nominations
Helmut Veith (1971-2016)
The Distributed Computing Column
Quantum Computing and Communication Complexity
What are kets?
Formal languages before Axel Thue
On the finitess of the multiplicable monoid generated by a nonnegative matrix
Distributed algorithmic mechanism design: recent results and future directions, Distributed Computing Column
Recursive Graphs are not Stable under Maximal Reduction
Hypergraphic Degree Sequences are Hard
Formula-handling computer solution of Boolean equations, I. Ring equations
Logic for Systems: A Gradual Introduction to Formal Methods
Homo Informaticus
News from the Isomorphism Front
Hierarchy of Discrete-Time Dynamical Systems, a Survey
Unifying ADT - and Evolving Algebra Specifications
On the complextiy of inductive inference
EATCS Fellows 2020 - Call for Nominations
Recursive VLSI design theory and application
Repetitions in the Kolakovski sequence
Noce labelling of event structures
Recent Advances Towards Proving P = BPP
Alonzo Church Award 2017 - Call for Nominations
Teaching Recursion and Dynamic Programming Before College
Fundamentals of p-values: Introduction
Finite, simple generating systems for partial recursive functions
Quantum Computation Explained to My Mother
A Survey of Constant Time Parallel Sorting
Modularity of Termination for Disjoint Term Graph Rewrite Systems: A Simple Proof
EATCS Distinguished Dissertation Award for 2021
The Logic in computer science Column
Marcus Contextual Grammars
The EATCS Award 2020 - Call for Nominations
Know the Person behind the Papers: Jean-Éric Pin
Report on HALG 2018
Roadmap of Infinite Results
Report on DCFS 2023
Logic in computer Science Column
On generalizations of the Nerode and Myhill theorems
A public key cryptosystem that defies cryptoanalysis
The Presburger Award 2020 - Laudatio for Dmitriy Zhuk
Some Notes on Computational Learing Theory
Process Definition using Subobject Transformation Systems
Report on AFL 2011
Towards algebraic data types grammars: a junction between algebraic specification and graph grammars
Contextual Semantics: From Quantum Mechanics to Logic, Databases, Constraints, and Complexity
Some Results on Regular Events for Multitape Finite Automata: A Preliminary Report
A curious grammar
The Complexity of Angel-Daemons and Game Isomorphism
Logic in Computer Ccience Column, guest authors
Space complexity: what makes planar graphs special?
Evolutionary Computation: A Guided Tour
Definite tree languages
IPEC Nerode Prize 2023
On Decision Problems for Timed Automata
Views on Linguistics
Nondeterministic systems and finite substitutions on regular languages
David Stifler Johnson: A Tribute by Lance Fortnow
Report on LPAR 2013
Algebraic Specification with subsorts using declarations
Periodicity and Unbordered Segments of Words
An Example of a Theorem that has Contradictory Relativization and Diagonalization Proof
Report on DISCO 2011
On the Notion of Bit Complexity
A Survey on Private Information Retrieval (Column: Computational Complexity)
A Note on Systems of Alternative Word Equations
On the Roots, Birth and Childhood of ETAPS
Semi-commutation for P-T Systems
Catalytic computation
DNA algorithm for breaking a propositional logic based cryptosystem
DNA Computing: A Survey
Using Stochastic Indexed Grammars for RNA Structure PredictionWith Pseudoknots
Space in weak propositional proof systems
Around and Beyond the Isomorphism Problem for Interval Graphs
LICS-ICALP 2020 Questionnaire Evaluation
Is P Versus NP Formally Independent?
Report on BCTCS 2023
Eight Open Problems in Distributed Computing
JACK: Just Another Concurrency Kit. The intergration Projekt
Some Preliminary Results on Three Combinatorial Board Games
Decision Problems Concerning the Thinness of DOL Languages
On the Control of Timed and Hybrid Systems
News from ACM transactions on Computation theory: New Editor-in-Chief
A note on the complexity of trie compaction
A Visitor from Buenos Aires in the United States
Ground Term Rewriting
A Note on First Order Unification
Inexpensive Linear-Optical Implementations of Deutsch's Algorithm
A New Distance-based Coding Method For Binary Trees
CRS 2017 - Call for Papers
Range Avoidance and the Complexity of Explicit Constructions
Open Questions in the Theory of Automatic Structures
Automata Tutor and what we learned from building an online teaching tool
Graphs and Monadic Second-Order Logic: Some Open Problems
Herbrand's Theorem and Equational Reasoning: Problems and Solutions
Can inductive proofs be automated? Part II
A New Experience with Graph Transformation
On Lamport's "Teaching Concurrency"
On the Regularity of Duplication Closure
The Presburger Award for Young Scientists 2017 - Call for Nominations
Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring
An Informal Visit to the Wonderful Land of Consensus Numbers and Beyond
The Japanese Chapter
Lindenmayer and DNA: Watson-Crick D0L Systems
Report from the Italian Chapter