yusuke1997/dblp-id-title huggingface dataset:
Dominator sequences in bipartite graphs
Node-disjoint paths in a level block of generalized hierarchical completely connected networks
Completeness of Type Assignment in Continuous Lambda Models
Projections for infinitary rewriting (extended version)
Prefix-free quantum Kolmogorov complexity
Enumeration of L-convex polyominoes by rows and columns
Infinite Linear Systems and one Counter Languages
Better lower and upper bounds for the minimum rainbow subgraph problem
i-Mark: A new subtraction division game
Posterior agreement for large parameter-rich optimization problems
A 3D fully parallel surface-thinning algorithm
epsilon-Approximations of k-Label Spaces
Embedding finite automata within regular expressions
Generalised fine and Wilf's theorem for arbitrary number of periods
The Largest Cartesian Closed Category of Stable Domains
A multi-tree routing scheme using acyclic orientations
The wake up dominating set problem
Two-Dimensional Partitioning Problems
Simultaneous Rigid E-unification and other Decision Problems Related to the Herbrand Theorem
A study on the effects of normalized TSP features for automated algorithm selection
Rank/select on dynamic compressed sequences and applications
Kolmogorov complexity and cellular automata classification
How bad is the merger paradox?
Weak Muller acceptance conditions for tree automata
Cycles and global attractors of reactantless and inhibitorless reaction systems
On Arithmetical First-Order Theories Allowing Encoding and Decoding of Lists
Maximal Codes With Bounded Deciphering Delay
n-Player impartial combinatorial games with random players
Paging with connections: FIFO strikes again
Semiperiodic words and root-conjugacy
The algebra of binary search trees
Confluence of the coinductive [lambda]-calculus
On converting CNF to DNF
Maximum Nash welfare and other stories about EFX
Special section on Descriptional Complexity of Formal Systems
Hardness and approximation for the star p -Hub Routing Cost Problem in metric graphs
Costs of general purpose learning
An abelian periodicity lemma
Tilings induced by a class of cubic Rauzy fractals
Hop chains: Secure routing and the establishment of distinct identities
Mod 3 arithmetic on triangulated Riemann surfaces
Pushing lines helps: Efficient universal centralised transformations for programmable matter
A new distributed alignment-free approach to compare whole proteomes
Hypercomputation: philosophical issues
Coding with variable block maps
Path cover using only short paths
Testing hypergraph colorability
Time-free cell-like P systems with multiple promoters/inhibitors
Finding a minimum medial axis of a discrete shape is NP-hard
Viral marketing of online game by DS decomposition in social networks
Deciding knowledge in security protocols under equational theories
Restricted holant dichotomy on domain sizes 3 and 4
Quantum evolution of words
Computational complexity of quantified Boolean formulas with fixed maximal deficiency
The topology of Mazurkiewicz traces
Cartesian Closed Categories of Algebraic CPOs
Combinatorial properties of double square tiles
An Augmented Voronoi Roadmap for 3D Translational Motion Planning for a Convex Polyhedron Moving Amidst Convex Polyhedral Obstacles
Deterministic summation modulo B_n, the Semigroup of Binary Relations on {0, 1, ..., n-1}
An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices
On Lindenmayerian Algebraic Power Series
On the Construction of Regular Minimal Broadcast Digraphs
Monotonicity in digraph search problems
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
Sufficient conditions for reachability in automata networks with priorities
Practical multi-party quantum homomorphic encryption
Optimal Heapsort Algorithm
Coding properties of DNA languages
Conditional diagnosability of component-composition graphs under the PMC model
Sur l'équivalence de descriptions de figures itérées
On PAC learning algorithms for rich Boolean function classes
On distributability
Super spanning connectivity of the generalized hypercube network
A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties
On sparse evaluation representations
Connected vertex covers in dense graphs
Leakage-resilient ring signature schemes
More efficient on-the-fly LTL verification with Tarjan's algorithm
Eager functions as processes
Some Decisional Problems on Rational Relations
Derivation tree analysis for accelerated fixed-point computation
A complete complexity classification of the role assignment problem
New results of exhaustive search in the game Amazons
Pinwheel Scheduling with Two Distinct Numbers
Uniform and nonuniform recognizability
Identity-based trapdoor mercurial commitments and applications
Partial key exposure attacks on RSA: Achieving the Boneh-Durfee bound
Linear logic as a tool for planning under temporal uncertainty
On prefix normal words and prefix normal forms
Singletons for simpletons revisiting windowed backoff with Chernoff bounds
Simple combinatorial auctions with budget constraints
Exact optimization for the ℓ 1 -Compressive Sensing problem using a modified Dantzig-Wolfe method
On the complexity of distance-d independent set reconfiguration
Pushdown Automata with Bounded Nondeterminism and Bounded Ambiguity
Linear representation of transversal matroids and gammoids parameterized by rank
On Infinite Computations in Denotational Semantics
Upgrading min-max spanning tree problem under various cost functions
Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
Resource bounded randomness and computational complexity
Polynomial-time sortable stacks of burnt pancakes
On some generalizations of the Thue-Morse morphism
An Upper Bound on the Average Number of Iterations of the LLL Algorithm
Space limited linear-time graph algorithms on big data
Non-injective knapsack public-key cryptosystems
Algebraic and Graph Theoretic Characterizations of Structured Flowchart Schemes
Highly irregular graph decompositions
Subword complexity of uniform D0L words over finite groups
Quantifying sequential subsumption
A Logic for Rewriting Strategies
Strategies anticipating a difference in search depth using opponent-model search
Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties
A game theoretic approach for minimal connected dominating set
Propriétés combinatoires des suites définies par le billard dans les triangles pavants
Characterization and computation of infinite-horizon specifications over Markov processes
A network flow approach to the Minimum Common Integer Partition Problem
Characterization and complexity results on jumping finite automata
Constructions of independent sets in random intersection graphs
Fast asynchronous systems in dense time
Reconciling a gene tree to a species tree under the duplication cost model
A compact fixpoint semantics for term rewriting systems
Incompleteness of First-Order Temporal Logic with Until
Distributed minimum vertex coloring and maximum independent set in chordal graphs
Asymptotic granularity reduction and its application
A computational complexity comparative study of graph tessellation problems
Lower bounds on the size of semi-quantum finite automata
Elementary Transition Systems
Subword complexity and power avoidance
Dynamic rank/select structures with applications to run-length encoded texts
Effective homology of bicomplexes, formalized in Coq
Decidability of a Temporal Logic Problem for Petri Nets
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
Fairness and Control in Multi-Agent Systems
Self-stabilizing timestamps
Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs
When does a random Robin Hood win?
Multidimensional data organization and random access in large-scale DNA storage systems
A method for symbolic analysis of security protocols
Mitigating covert channels based on analysis of the potential for communication
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
Separation of uniform learning classes
An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems
Puissances de mots et reconnaissabilité des point fixes d'une substitution
Lower bounds for random 3-SAT via differential equations
Reaching efficiency through collaboration in membrane systems: Dissolution, polarization and cooperation
A Characterisation of the Least-Fixed-Point Operator by Dinaturality
Completeness of intersection and union type assignment systems for call-by-value lambda-models
Square, power, positive closure, and complementation on ordered and star-free languages
Real number computation through Gray code embedding
Automatic Synthesis of Typed Lambda-Programs on Term Algebras
Analyse und Synthese von Asynchronen ND-Automaten
A new conceptual framework for analog computation
The Computational Complexity of the Satisfiability of Modal Horn Clauses for Modal Propositional Logics
The maximum agreement forest problem: Approximation algorithms and computational experiments
Fast Detection of Polyhedral Intersection
Minimum energy multicast/broadcast routing with reception cost in wireless sensor networks
Competitive router scheduling with structured data
Unit refutability of horn constraint systems - certification and parallel complexity
The 1-good-neighbour diagnosability of modified bubblesort graphs under the PMC and MM* models
A Semi-Algorithm for Algebraic Implementation Proofs
Universal reconstruction of a string
Foreword - MFPS 1996
A refined exact algorithm for Edge Dominating Set
Computation of Recursive Functionals Using Minimal Initial Segments
On Some Equations in Free Partially Commutative Monoids
On conditions for mappings to preserve optimal solutions of semiring-induced valuation algebras
Minimizing energy on homogeneous processors with shared memory
Preface: Quantitative aspects of programming languages
On maximal synchronous codes
Computing the similarity of two sequences with nested arc annotations
Edge coloring of planar graphs without adjacent 7-cycles
A new approximation algorithm for the k-facility location problem
The complexity of membership problems for circuits over sets of integers
On the number of components in cooperating distributed grammar systems
Kolmogorov Complexity - Foreword
Efficiently computing runs on a trie
Elements of a theory of algebraic theories
Ternary is still good for Parikh matrices
Weak Logic Theory
Improved method for finding optimal formulas for bilinear maps in a finite field
A Typed lambda-Calculus for Proving-by-Example and Bottom-Up Generalization Procedure
Cops, a fast robber and defensive domination on interval graphs
Acceptable Programs Revisited
On approximating minimum vertex cover for graphs with perfect matching
On atomic structure of P 5 -free subclasses and Maximum Weight Independent Set problem
On the NP-hardness of speed scaling with sleep state
Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement
Valuations of Languages, with Applications to Fractal Geometry
Approximation schemes for two-agent scheduling on parallel machines
Two greedy consequences for maximum induced matchings
One query reducibilities between partial information classes
Simple, strict, proper, happy: A study of reachability in temporal graphs
Concise Description of Finite Languages
The Average CRI-Length of a Controlled ALOHA Collision Resolution Algorithm
A bijection for triangulations of a polygon with interior points and multiple edges
Bayesian generalized network design
All cartesian closed categories of quasicontinuous domains consist of domains
Constructible functions in cellular automata and their applications to hierarchy results
A representation theorem for recovering contraction relations satisfying wci
Tiling with bars under tomographic constraints
Parallel On-Line Parsing in Constant Time per Word
Degree constrained 2-partitions of semicomplete digraphs
Strategy recovery for stochastic mean payoff games
A Structure to Decide Reachability in Petri Nets
On square factors and critical factors of k -bonacci words on infinite alphabet
Offline black and white bin packing
Affine automata and related techniques for generation of complex images
Efficient algorithms for the one-dimensional k-center problem
Algorithm and hardness results on neighborhood total domination in graphs
X-Automata on omega-Words
Interval routing in reliability networks
Constructions des bases standard des K<A>-modules à droite
Approximation hardness of deadline-TSP reoptimization
Verification of cryptographic protocols: tagging enforces termination
Constructing an asymptotic phase transition in random binary constraint satisfaction problems
Data fusion using Hilbert space multi-dimensional models
Generalised information systems capture L-domains
Papers from CG 1998 - Foreword
Quantum branching programs and space-bounded nonuniform quantum complexity
Informative labeling schemes for graphs
Sorting balls and water: Equivalence and computational complexity
Weak Second Order Characterizations of Various Program Verification Systems
Robust matroid bandit optimization: Near-optimal rates under adversarial contamination
On the sizes of DPDAs, PDAs, LBAs
A Complete Classification of Deterministic Root-To-Frontier Tree Transformation Classes
A study of Jacobi-Perron boundary words for the generation of discrete planes
Multisets and Structural Congruence of the pi-Calculus with Replication
P-RAM vs. RP-RAM
Numerical P systems with migrating variables
Local Constraints in Programming Languages Part I: Syntax
The computational complexity of Holant problems on 3-regular graphs
Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces
Connectivity for some families of composition networks
Secure and self-stabilizing clock synchronization in sensor networks
On weak and weighted computations over the real closure of Q
Principles of proof scores in CafeOBJ
Hypercomputation with quantum adiabatic processes
A reducibility for the dot-depth hierarchy
Preface: Special Issue on Reaction Systems
Semantics of dynamic hiding in mobile UTP-CSP
Inference of [omega]-languages from prefixes
Efficient decision procedure for propositional projection temporal logic
Packing arrays
A prismoid framework for languages with resources
Improvements in closest point search based on dual HKZ-bases
Well-definedness and semantic type-checking for the nested relational calculus
Number conserving cellular automata II: dynamics
Convergence of set-based multi-objective optimization, indicators and deteriorative cycles
A necessary condition for a graph to be the visibility graph of a simple polygon
Editorial for Computing and Combinatorics Conference
An Algebraic Characterization of Frontier Testable Tree Languages
Classes of representable disjoint NP-pairs
Generalized Parenthesis Languages and Minimization of their Parenthesis Parts
On non-progressive spread of influence through social networks
Constructive System for Automatic Program Synthesis
k -Circle formation by disoriented asynchronous robots
Oracles for vertex elimination orderings
Unrestricted Complementation in Language Equations Over a One-Letter Alphabet
Efficient dynamic range minimum query
On Finite Semigroups of Matrices
On learning unions of pattern languages and tree patterns in the mistake bound model
Transporting continuity properties from a poset to its subposets
A Minimal Code List
On the semantic equivalence of language syntax formalisms
Submodular learning and covering with response-dependent costs
Approximating minimum feedback vertex sets in hypergraphs
A Context-Free Language Decision Problem
On temporal logic constraint solving for analyzing numerical data time series
The computational power of simple protocols for self-awareness on graphs
S4 enriched multimodal categorial grammars are context-free: Corrigendum
The structure and complexity of Nash equilibria for a selfish routing game
A Bijection Between Cliques in Graphs and Factorizations in Free Monoids
Strong connectivity of sensor networks with double antennae
Self-updatable encryption: Time constrained access control with hidden attributes and better efficiency
Fuzzy context-free languages - Part 2: Recognition and parsing algorithms
Faster entropy-bounded compressed suffix trees
Analysis of the (1, λ )- σ -Self-Adaptation Evolution Strategy with repair by projection applied to a conically constrained problem
The h-connectivity of exchanged crossed cube
Approximation algorithms for sorting by length-weighted prefix and suffix operations
Feasibility Problems for Recurring Tasks on one Processor
Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs
Internal shortest absent word queries in constant time and linear space
On the expressive power of monadic least fixed point logic
Finding the shortest boundary guard of a simple polygon
Map construction of unknown graphs by multiple agents
Characterizing Specification Languages which Admit Initial Semantics
Semantics and proof-theory of depth bounded Boolean logics
An Extensional Treatment of Lazy Data Flow Deadlock
Performance analysis of evolution strategies with multi-recombination in high-dimensional RN-search spaces disturbed by noise
Algorithmic aspects of paired disjunctive domination in graphs
Degree-bounded minimum spanning tree for unit disk graph
Rewriting with a Nondeterministic Choice Operator
Dynamic Dictionary Matching with Failure Functions
Constants and label-equivalence: A decision procedure for reflexive regular splicing languages
Spread of influence in weighted networks under time and budget constraints
On the Reachability Problem for 5-Dimensional Vector Addition Systems
Broadcasting in unstructured peer-to-peer overlay networks
Some Elements of a Galois Theory of the Structure and Complexity of the Tree Automorphism Problem
The range 1 query (R1Q) problem
On logarithmic-space computable real numbers
Nimber-preserving reduction: Game secrets and homomorphic Sprague-Grundy theorem
Index Sets and Presentations of Complexity Classes
Completing circular codes in regular submonoids
Overflow management with self-eliminations
Wireless evacuation on m rays with k searchers
Fault isolation and identification in general biswapped networks under the PMC diagnostic model
Specification and Verification of Decentralized Daisy Chain Arbiters with omega-Extended Regular Expressions
ER modelling from first relational principles
Parameterized complexity of finding connected induced subgraphs
1-optimality of static BSP computations: scheduling independent chains as a case study
An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs
On gamma-Reducibility Versus Polynomial Time Many-One Reducibility
On ultrametric 1-median selection
Space hierarchy theorem revised
The complexity of Fibonacci-like kneading sequences
Efficiently approximating color-spanning balls
Graphical Versus Logical Specifications
Internal models of system F for decompilation
Some Combinatorial Properties of Sturmian Words
Hardness results for neural network approximation problems
Towards a theory of mixing graphs: A characterization of perfect mixability
Type systems equivalent to data-flow analyses for imperative languages
A syntactical proof of the Marriage Lemma
A Polynomial Algorithm for Solving Systems of Two Linear Diophantine Equations
Improved average complexity for comparison-based sorting
Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
Boundary sketching with asymptotically optimal distance and rotation
Product 1 over 1-Universality of Some Propositional Logics of Concurrent Programs
Improved approximation algorithms for scheduling parallel jobs on identical clusters
Computing with Infinite Objects
On some geometric optimization problems with segments
The g -good-neighbor conditional diagnosability of the crossed cubes under the PMC and MM* model
Learning indexed families of recursive languages from positive data: A survey
On the Bahncard problem
Modal Logic and Algebraic Specifications
Towards a geometry of recursion
Towards a Foundation of Completion Procedures as Semidecision Procedures
Multiple-conclusion system as communication calculus
Codes Engendrant Certains Systemes Sofiques
On the Elimination of Iteration Quantifiers in a Fragment of Algorithmic Logic
Concerning Two-Adjacent Context-Free Languages
Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
On the complexity of recognizing Stick, BipHook and Max Point-Tolerance graphs
Growth rates of complexity of power-free languages
Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
Few induced disjoint paths for H -free graphs
On the size of the smallest alphabet for Lyndon trees
Constructive Proofs of the Range Property in lambda-Calculus
A direct algorithm to compute the topological Euler characteristic and Chern-Schwartz-MacPherson class of projective complete intersection varieties
Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
On the Computational Power of Automata with Time or Space Bounded by Ackermann's or Superexponential Functions
Traveling salesman problems in temporal graphs
Learnability of quantified formulas
Optimal movement of mobile sensors for barrier coverage of a planar region
Séries de Malcev-Neumann sur le groupe libre et questions de ratonalité
On the descriptional complexity of some rewriting mechanisms regulated by context conditions
Existence and construction of a C-shaped module within a floorplan
Evolution and observation--a non-standard way to generate formal languages
On functors preserving coproducts and algebras with iterativity
Fault-tolerant Hamiltonian connectivity of 2-tree-generated networks
On One-Way Functions and Polynomial-Time Isomorphisms
Reductions Among Polynomial Isomorphism Types
Rewriting queries using views with access patterns under integrity constraints
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters
Non Deterministic Polynomial Optimization Problems and their Approximations
On the k -path cover problem for cacti
List r -dynamic coloring of sparse graphs
k-Partitioning problems with partition matroid constraint
The cardinality constrained inverse center location problems on tree networks with edge length augmentation
Approximate and dynamic rank aggregation
On Updating Suffix Tree Labels
Groups of Finite Elementary Codes
Conditional diagnosability of the round matching composition networks
Scheduling jobs with sizes and delivery times on identical parallel batch machines
An alternative definition of splicing
Symbolic model checking with rich assertional languages
Further closure properties of input-driven pushdown automata
Determinism and Looping in Combinatory PDL
On calibration error of randomized forecasting algorithms
On a Combinatorial Property of Sturmian Words
Pebble-depth
Bilateral locally testable languages
P-Sufficient Statistics for PAC Learning k-term-DNF Formulas through Enumeration
A Sheaf-Theoretic Approach to Pattern Matching and Related Problems
On the relationship between fuzzy and Boolean cellular automata
A Parsing Automata Approach to LR Theory
Reachability Analysis of Dynamical Systems Having Piecewise-Constant Derivatives
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
Finding all maximally-matchable edges in a bipartite graph
An approximation algorithm for diversity-aware fair k -supplier problem
Machines that perform measurements
Safe reasoning with Logic LTS
Coloring clique-hypergraphs of graphs with no subdivision of K 5
Measuring security in IoT communications
Lookahead analysis in exact real arithmetic with logical methods
Self-stabilizing l-exclusion
Truncated suffix trees and their application to data compression
Semi-online scheduling problems on two uniform machines under a grade of service provision