yusuke1997/dblp-id-title huggingface dataset:
Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems
Searching and Pebbling
Covering problems for partial words and for indeterminate strings
A study on team bisimulation and H-team bisimulation for BPP nets
A CPS encoding of name-passing in Higher-order mobile embedded resources
Notes on Finitely Generated Semigroups and Pumping Conditions for Regular Languages
Parameterized approximation algorithms for weighted vertex cover
An axiomatic semantics for Esterel
Approximation algorithms for the min-max clustered k -traveling salesmen problems
On the Balance Property of Patricia Tries: External Path Length Viewpoint
An introduction to periodical discrete sets from a tomographical perspective
Counting rooted maps on a surface
Arrows for secure information flow
A semi-dynamical approach for solving qualitative spatial constraint satisfaction problems
The Undecidability of the Second-Order Unification Problem
Concentration independent random number generation in tile self-assembly
Sequential vector packing
On-line single-server dial-a-ride problems
Operational state complexity of nested word automata
Complexity of the game connected domination problem
The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability
Performance of Fault-Tolerant Data and Compute Intensive Programs over a Network of Workstations
Exploring the gap between treedepth and vertex cover through vertex integrity
Fault-tolerant embedding of paths in crossed cubes
New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision
Compositional SOS and beyond: a coalgebraic view of open systems
Fast Parallel String Prefix-Matching
Multi-Dimensional Logic Programming: Theoretical Foundations
Sequential grammars and automata with valences
Distributed processes and location failures
Complexity of multi-head finite automata: Origins and directions
Class constrained bin packing revisited
Distance bounds of epsilon -points on hypersurfaces
Comment Verifier l'Associativite d'une Table de Groupe
Star-Free Trace Languages
On listing, sampling, and counting the chordal graphs with edge constraints
On the totalk-diameter of connection networks
An Efficient Solution of the Firing Mob Problem
Efficient sub-5 approximations for minimum dominating sets in unit disk graphs
Nonconvex cases for carpenter's rulers
On the small cycle transversal of planar graphs
On the simulation of quantum turing machines
Approximating the minimum independent dominating set in perturbed graphs
On k -enclosing slab problems
Decidability and syntactic control of interference
On the number of upward planar orientations of maximal planar graphs
Exhaustive generation of gominoes
Lexicographically least words in the orbit closure of the Rudin-Shapiro word
A finite set of functions with an EXPTIME-complete composition problem
Improved approximation of the minimum cover time
Unwinding biological systems
Deterministic versus randomized adaptive test cover
Upward and quasi-upward planarity testing of embedded mixed graphs
Functional labels and syntactic entropy on DNA strings and proteins
Simon's congruence pattern matching
Every real number greater than 1 is a critical exponent
Vertex deletion problems on chordal graphs
A uniform solution to SAT using membrane creation
Non-additive two-option ski rental
Hypergraph burning, matchings, and zero forcing
Convergence of the diffusion method for weighted torus graphs using Fourier analysis
On simulating Turing machines with matrix semigroups with integrality tests
Boosting distinct random sampling for basic counting on the union of distributed streams
Generalized Gray codes with prescribed ends
Specifying Byrd's Box Model with a Continuation Semantics
Compact representations as a search strategy: Compression EDAs
Revisiting RSA-polynomial problem and semiprime factorization
Lowness for bounded randomness
Detecting approximate periodic patterns
Default theories over monadic languages
Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
Parallel Transient Time of One-Dimensional Sand Pile
On algebraic and logical specifications of classes of regular languages
Rasiowa-Sikorski deduction systems in computer science applications
Verification of mobile ad hoc networks: An algebraic approach
Component composition preserving behavioral contracts based on communication traces
Binary Search and Recursive Graph Problems
Structural parameterizations of vertex integrity
On stateless multihead automata: Hierarchies and the emptiness problem
Asymptotic orbits of primitive substitutions
IAP for dummies: The YAP Design
On Recursive Bounds for the Exceptional Values in Speed-Up
A note on algebras of languages
A Hierarchy Based on Output Multiplicity
Erratum to "Acyclic automata and small expressions using multi-tilde-bar operators" [Theoret. Comput. Sci. 411 (38-39) (2010) 3423-3435]
The complexity of fully proportional representation for single-crossing electorates
On learning multivalued dependencies with queries
On Inefficient Special Cases of NP-Complete Problems
On extremal cases of Hopcroft's algorithm
Parameterised boolean equation systems
Generalized framework for Group Testing: Queries, feedbacks and adversaries
Computing the longest common almost-increasing subsequence
A Formal Framework for Independence with Respect to Transactions in the Universal Relation Model
A Uniform Approach to Define Complexity Classes
On Dynamic Algebras
Approximations for the general block distribution of a matrix
The discrete sell or hold problem with constraints on asset values
Additions and Corrections to "Terminal Coalgebras in Well-founded Set Theory"
Preface to special issue on theory and applications of Graph Searching
Unguardedness mostly means many solutions
Probe threshold and probe trivially perfect graphs
Diagnosability of labeled Dp-automata
Une équivalence sur les lambda-termes
Algebraic Specifications of Computable and Semicomputable Data Types
Almost-Everywhere Complexity Hierarchies for Nondeterministic Time
A new filtration method and a hybrid strategy for approximate string matching
Effectively closed sets and graphs of computable real functions
A Pumping Result for 2-Context-Free Languages
Breaking the 2-competitiveness barrier for two servers in a tree
Retraction notice to "A New Approximation Algorithm for the Minimum 2-Edge-Connected Spanning Subgraph Problem" [Theoretical Computer Science 943 (2023) 121-130]
Cylindric structures and dependencies in relational databases
An Introduction to the Regular Theory of Fairness
The synchronized ambient calculus
A Gentzen-style sequent calculus of constructions with expansion rules
Advances in the Theory and Practice of Graph Drawing
On process rate semantics
Coherent Banach Spaces: A Continuous Denotational Semantics
Bounding game temperature using confusion intervals
Analysis on methods to effectively improve transfer learning performance
A rounding algorithm for approximating minimum Manhattan networks
Finding a subdivision of a digraph
Leakage-resilient biometric-based remote user authentication with fuzzy extractors
Topological stability of kinetic k -centers
Colouring fuzziness for systems biology
An auction-based market equilibrium algorithm for a production model
On Eliminating Nondeterminism from Turing Machines which Use less than Logarithm Worktape Space
View-based query processing: On the relationship between rewriting, answering and losslessness
Complexity of some problems in positive and related calculi
Solving the minimum bisection problem using a biologically inspired computational model
Kleene stars of the plane, polylogarithms and symmetries
Expansion-based QBF solving versus Q-resolution
An ambiguity hierarchy of weighted context-free grammars
Oracle Computations in Parallel Numerical Linear Algebra
Completeness of a First-Order Temporal Logic with Time-Gaps
A search game on a hypergraph with booby traps
Sur une Variante des Fonctions Sequentielles
Characterization of context-free languages
Composing leads-to properties
Equivalence is in the Eye of the Beholder
A characterization of regular circular languages generated by marked splicing systems
Recent results and questions in combinatorial game complexities
A (restricted) quantifier elimination for security protocols
On Space-Efficient Algorithms for Certain NP-Complete Problems
Min-max communities in graphs: Complexity and computational properties
On Coordinated Selective Substitutions: Towards a Unified Theory of Grammars and Machines
New space/time tradeoffs for top-k document retrieval on sequences
Dynamic networks of finite state machines
Corrigendum to "On the computing powers of L-reductions of insertion languages" [Theor. Comput. Sci. 862 (2021) 224-235]
Rational Relations and Ratonal Series
Asymptotically optimal declustering schemes for 2-dim range queries
A Formal Derivation of the Decidability of the Theory SA
Characterizing polynomial time complexity of stream programs using interpretations
Parameter space abstraction and unfolding semantics of discrete regulatory networks
Information coverage maximization for multiple products in social networks
Simulatable verifiable random function from the LWE assumption
Succinct data structures for Searchable Partial Sums with optimal worst-case performance
Controlling loosely cooperating processes
The 4-set tree connectivity of ( n , k )-star networks
The sequence of return words of the Fibonacci sequence
Separation of circulating tokens
Mechanizing type environments in weak HOAS
Constant amortized time enumeration of Eulerian trails
The periodic domino problem revisited
Towards an algebraic theory of typed mobile processes
On upper bound graphs with respect to operations on graphs
Uncomputability: the problem of induction internalized
Letter frequency in infinite repetition-free words
Proof techniques in Membrane Computing
Tiling and Local Rank Properties of the Morse Sequence
Locating a backtracking robber on a tree
Synchronous black hole search in directed graphs
Reachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) to hypergraphs
Step-optimal implementations of large single-writer registers
Recognizing some complementary products
Multiple constraints on three and four words
Opinion maximization in social networks via link recommendation
On a Generalized Product of Domains
Lawson topology of the space of formal balls and the hyperbolic topology
Palindrome positions in ternary square-free words
Squarefree words with interior disposable factors
Universal Axioms for Bisimulations
Ranking and unranking algorithms for derangements based on lexicographical order
On lattices from combinatorial game theory modularity and a representation theorem: Finite case
A characterization of oblivious message adversaries for which Consensus is solvable
The complexity of two problems on arithmetic circuits
A core model for choreographic programming
On the bandwidth of 3-dimensional Hamming graphs
Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies
influence: A partizan scoring game on graphs
Higher-dimensional syntax
Interdefinability of Parallel Operations in PCF
A Stackelberg knapsack game with weight control
An Algebraic Correctness Criterion for Intuitionistic Multiplicative Proof-Nets
Subword Topology
Some sufficient conditions for 1-planar graphs to be Class 1
Advances in Discrete Geometry for Computer Imagery: Preface
Online rectangle filling
Succinct representations of permutations and functions
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
Mind change complexity of learning logic programs
Precise Goal-Independent Abstract Interpretation of Constraint Logic Programs
Minimal invariant sets in a vertex-weighted graph
Computational complexity of counting problems on 3-regular planar graphs
Low-weight superimposed codes and related combinatorial structures: Bounds and applications
An exponential time 2-approximation algorithm for bandwidth
Density via duality
An Application of Hajós Factorizations to Variable-Length Codes
On systems of word equations with simple loop sets
Algebras of modal operators and partial correctness
Competitive caching of query results in search engines
Edge coloring of planar graphs which any two short cycles are adjacent at most once
Branching bisimulation congruence for probabilistic systems
Semantics for Logic Programs Without Occur Check
Model checking mobile ambients
Three small universal spiking neural P systems
Calculi, types and applications: Essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi Della Rocca
Foundations of Boolean stream runtime verification
How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms
On the Power of Cooperation: A Regular Representation of Recursively Enumerable Languages
On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates
Minimal probabilistic P systems for modelling ecological systems
A translation of TPAL p into a class of timed-probabilistic Petri nets
On the Analysis of Algorithms for Trees
Covering arrays avoiding forbidden edges
On Approximate and Algebraic Computability over the Real Numbers
Existential MSO over two successors is strictly weaker than over linear orders
Amortized Efficiency of a Path Retrieval Data Structure
Algebraic Calculi of Processes and Net Expressions
Characterization and Closure Properties of Linear Omega-Languages
rCOS: A refinement calculus of object systems
On two open problems of 2-interval patterns
Congruential complements of ground term rewrite systems
A Few Logs Suffice to Build (almost) All Trees: Part II
Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems
Two improved schemes in the bitprobe model
Pathlength of outerplanar graphs
Institutions for Logic Programming
Proof Methods of Declarative Properties of Definite Programs
Towards Modular Binding-Time Analysis for First-order Mercury
An informational view of classical logic
Complex Boolean Networks Obtained by Diagonalization
The weak lambda calculus as a reasonable machine
Trees in Algebra and Programming (Editorial)
Operator precedence temporal logic and model checking
A Probabilistic Distributed Algorithm for Set Intersection and its Analysis
Two-stage combinatorial optimization problems under risk
Preemptive scheduling with simple linear deterioration on a single machine
The Absence and the Presence of Fixed Point Combinators
State-based opacity of labeled real-time automata
Two equivalence relations on digital lines with irrational slopes. A continued fraction approach to upper mechanical words
Search-space size in contraction hierarchies
Generating Ordered Trees
A Formalization of Reasoning not Derived from Standard Predicate Logic
R-LINE: A better randomized 2-server algorithm on the line
Tight lower bounds on the number of bicliques in false-twin-free graphs
A Java-like calculus with heterogeneous coeffects
Synthesis from component libraries with costs
Interpretations of Recursion under Unbounded Nondeterminacy
Delivery Route Optimization with automated vehicle in smart urban environment
Subset Languages of Petri Nets Part I: The Relationship to String Languages and Normal Forms
PRE: Stronger security notions and efficient construction with non-interactive opening
Chromatic index of graphs with no cycle with a unique chord
Structured Algebraic Specifications: A Kernel Language
Characterizations of Rational omega-Languages by Means of Right Congruences
A Natural Semantics of First-Order Type Dependency
Rotations in the stable b-matching problem
Tile rewriting grammars and picture languages
A Context Dependent Equivalence Between Processes
Reversal and transposition medians
Space lower bounds for low-stretch greedy embeddings
Capturing Complexity Classes by Fragments of Second-Order Logic
The complexity of asynchronous model based testing
An efficient counting network
Priority queues with decreasing keys
Monoidal indeterminates and categories of possible worlds
Tractability beyond β -acyclicity for conjunctive queries with negation and SAT
Espaces métriques rationnellement présentés et complexité, le cas de l'espace des fonctions réelles uniformément continues sur un intervalle compact
A Generalization of Sardinas and Patterson's Algorithm to Z-Codes
Revolutionaries and spies: Spy-good and spy-bad graphs
The extra connectivity of the enhanced hypercubes
Strong matching preclusion for n-dimensional torus networks
Factorization Forests of Finite Height
Accidental combinatorist, an autobiography
A Fully abstract presheaf semantics for SCCS with finite delay
On Satisfying the LL-Iteration Theorem
Improved bounds for online scheduling with eligibility constraints
Flowshop problem F2 → D|v = 1, c ≥ 1|C max revisited
Restarting automata with restricted utilization of auxiliary symbols
Identity-based encryption with security against the KGC: A formal model and its instantiations
On Translations of Temporal Logic of Actions Into Monadic Second-Order Logic
Palindromic length and reduction of powers
Free Objects and Equational Deduction for Partial Conditional Specifications
Atomic routing games on maximum congestion
Specifying termination in CSP
Kernel and fast algorithm for dense triplet inconsistency
On the expressiveness of higher dimensional automata
The frontier of intractability for EFX with two agents
On slender 0L languages
On Fine and Wilf's theorem for bidimensional words
Graph Driven BDDs - A New Data Structure for Boolean Functions
Strong matching preclusion for non-bipartite torus networks
Scheduling UET-UCT Series-Parallel Graphs on Two Processors
An approximation algorithm for the k -median problem with uniform penalties via pseudo-solution
An Optimal Distributed Algorithm for Recognizing Mesh-Connected Networks
On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering
Partitioning subclasses of chordal graphs with few deletions
A Proof-Theoretic Characterization of Observational Equivalence
On the relevance of time in neural computation and learning
Graph operations on parity games and polynomial-time algorithms
Optimistic atomic broadcast: a pragmatic viewpoint
Learning Orthogonal F-Horn Formulas
On overabundant words and their application to biological sequence analysis
A categorical model for the geometry of interaction
Trajectory optimization of laser-charged UAV to minimize the average age of information for wireless rechargeable sensor network
Corona: A stabilizing deterministic message-passing skip list
Deterministic approximation algorithm for submodular maximization subject to a matroid constraint
Almost-Certain Eventualities and Abstract Probabilities in the Temporal Logic PTL
Monotone term decision lists
Discovering instances of poetic allusion from anthologies of classical Japanese poems
Equational abstractions
Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers
The Undecidability of Pattern Matching in Calculi Where Primitive Recursive Functions are Representable
Typical rounding problems
From local to global temporal logics over Mazurkiewicz traces
Generation of Combinatorial Structures
Hilbert Q-Modules and Nuclear Ideals in the Category of v-Semilattices with a Duality
Frontiers in Algorithmics
On invertible and stably reversible non-uniform cellular automata
A genetic system based on simulated crossover of sequences of two-bit genes
Uniqueness of Scott's Reflexive Domain in P-omega
Improved deterministic algorithms for non-monotone submodular maximization
Completions of Perpetual Logic Programs
Completeness of a relational calculus for program schemes
Minimal Separating Sets for Acceptance Conditions in Muller Automata
On the error resilience of ordered binary decision diagrams
Approximate ridesharing of personal vehicles problem
Tree shift topological entropy
The three-squares lemma for partial words with one hole
On pairwise compatibility graphs having Dilworth number two
Role-based access control for boxed ambients
Gap-planar graphs
Untangled monotonic chains and adaptive range search
A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
A property of left-linear rewrite systems preserving recognizability
The Theory of Functional and Template Dependencies
To Prof. Dr. Wolfgang Wechler
Nonacceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree Automata
On the viability of the deterministic consensus hierarchy
Motif patterns in 2D
Foreword: Special issue in honor of the 60th Birthday of Professor Alberto Apostolico: Work is for people who do not know how to: SAIL - String Algorithms, Information and Learning
On two-way nondeterministic finite automata with one reversal-bounded counter
Gradient complexity and non-stationary views of differentially private empirical risk minimization
Characterization of circular D0L-systems
Observational congruences for dynamically reconfigurable tile systems
Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees
A Note on the Density of Oracle Decreasing Time-Space Complexity
Online Computations of Differentiable Functions
Equivalence of Infinite Behavior of Finite Automata
Bounds on the burning numbers of spiders and path-forests
Exponential inapproximability and FPTAS for scheduling with availability constraints
The Maximum Flow Problem is Log Space Complete for P
Algorithms for covering multiple barriers
On the complexity of Dominating Set for graphs with fixed diameter
New complexity results for shop scheduling problems with agreement graphs
Extension and its price for the connected vertex cover problem
Diagnosability and hybrid diagnosability of some classes of graphs under the BPMC model
Properties of Input-Consuming Derivations
The Khalimsky topologies are precisely those simply connected topologies on Z n whose connected sets include all 2n-connected sets but no (3n-1)-disconnected sets
CTL* and ECTL* as Fragments of the Modal mu-Calculus
Constructing minimum changeover cost arborescenses in bounded treewidth graphs
A tight bound for shortest augmenting paths on trees
A Logical View of Composition
Two-Way Automata with More than one Storage Medium
State grammars with stores
Down the Borel hierarchy: Solving Muller games via safety games
Foundations of formal reconstruction of biochemical networks
Some approximation algorithms for the clique partition problem in weighted interval graphs
The approximate swap and mismatch edit distance
Complexity results for deciding Networks of Evolutionary Processors
Encoding types in ML-like languages
Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude
A Linear-History Semantics for Languages for Distributed Programming
Proof finding algorithms for implicational logics
Terminal Coalgebras in Well-Founded Set Theory
A generalized neighborhood for cellular automata
Robust Machines Accept Easy Sets
The continuum as a final coalgebra
Complexité du Calcul du Développement d'un Nombre Réel en Fractions Continues
Theorem Proving by Chain Resolution
Sampling-based dimension reduction for subspace approximation with outliers
Prime normal form and equivalence of simple grammars
On some generalizations of abelian power avoidability
Efficiency and equilibrium in the electronic mail game; the general case
Properties of a class of Toeplitz words
Index set expressions can represent temporal logic formulas
An optimal pre-determinization algorithm for weighted transducers
Representing planning autonomy in agent organizational models
Online unit clustering: Variations on a theme
Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions
Testing whether a digraph contains H-free k-induced subgraphs
Algebraic nets with flexible arcs
Space-efficient Euler partition and bipartite edge coloring
The linear arboricity of planar graphs with no short cycles
Finding median in read-only memory on integer input
Learning without coding
Systèmes de numération indépendants et syndéticité