yusuke1997/dblp-id-title huggingface dataset:
Colourful components in k -caterpillars and planar graphs
Convergence rates of Markov chains for some self-assembly and non-saturated Ising models
Smaller kernels for 3-leaf power modifications problems
Realizability of graphs as triangle cover contact graphs
On searching a table consistent with division poset
Displaying trees across two phylogenetic networks
Load-balanced parallel banded-system solvers
Graphs of linear clique-width at most 3
An analytic approach to the asymptotic variance of trie statistics and related structures
Small stretch (alpha, beta)-spanners in the streaming model
Bitonal membrane systems: Interactions of biological membranes
Aldo de Luca (1941-2018)
Efficient algorithms for consensus string problems minimizing both distance sum and radius
Offensive alliances in graphs
Efficient parallel algorithms for parameterized problems
A Geometric Construction of a Superconcentrator of Depth 2
A Secure Energy Aware Meta-Heuristic Routing Protocol (SEAMHR) for sustainable IoT-Wireless Sensor Network (WSN)
Total coloring of planar graphs with maximum degree 8
Approximating Shortest Superstrings with Constraints
Probabilistic and nondeterministic aspects of anonymity
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
Multiple sink location problems in dynamic path networks
A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions
Comparative Metric Semantics for Concurrent Prolog
Optimal Algorithms for Computing the canonical form of a circular string
Constrained Kripke structure for identifying parameters of biological models
An improved approximation algorithm for the maximum TSP
Online parameterized dictionary matching with one gap
Unique decipherability in formal languages
Compressed parameterized pattern matching
Improved approximation algorithms for maximum lifetime problems in wireless networks
Wide-sense nonblocking for multi-log d N networks under various routing strategies
Generative abstraction of Markov population processes
A Maude specification of an object-oriented model for telecommunication networks
An efficient identity based generalized signcryption scheme
An Algebraic Theory of Fair Synchronous Communicating Processes
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
The exact multiple pattern matching problem solved by a reference tree approach
On the longest common parameterized subsequence
Enhancing global SLS-resolution with loop cutting and tabling mechanisms
Switching investments
Lower bounds for the size of deterministic unranked tree automata
Strong Surjectivity is Equivalent to C-Injectivity
Regulated variants of limited context restarting automata
Fixed Points in Cartesian Closed Categories
Order-incompleteness and finite lambda reduction models
New sufficient conditions on the degree sequences of uniform hypergraphs
Concurrency in timed automata
Designing small keyboards is hard
On the presence of periodic configurations in Turing machines and in counter machines
Color-spanning localized query
An analysis of the LPT algorithm for the max-min and the min-ratio partition problems
Information dissemination in wireless ad-hoc networks under the weighted-TIM framework
Two-robot source seeking with point measurements
An Algebraic Generalization of Frege Structures-Binding Algebras
Cycles and communicating classes in membrane systems and molecular dynamics
An adaptation-complete proof system for local reasoning about cloud storage systems
Finding read-once resolution refutations in systems of 2CNF clauses
Finding large cliques in sparse semi-random graphs by simple randomized search heuristics
Collaborative coalitions-based joint service caching and task offloading for edge networks
Not just the Garden of Eden: Additional takes on cellular automata surjectivity
Syntax vs. semantics: A polarized approach
Counting Non-Isomorphic Chord Diagrams
Scheduling to tradeoff between the number and the length of accepted jobs
On Interleaving Behaviour of PT-Nets
Non-asymptotic calibration and resolution
Two techniques in the area of the star problem in trace monoids
Autopoietic automata: Complexity issues in offspring-producing evolving processes
Languages Whose n-Element Subsets Are Codes
The Intractability of Resolution
On Sets of Solutions to Combinator Equations
Undecidability of Bisimilarity for Petri Nets and Some Related Problems
D-Continuous Causal Nets: A Model of Non-Sequential Processes
SC-hyperdecidability of R
Theoretical foundations of security analysis and design II
Alpha Markov Measure Field model for probabilistic image segmentation
BCK-Combinators and Linear lambda-Terms have Types
Synthesis of multi-qudit hybrid and d-valued quantum logic circuits by decomposition
Mirror games against an open book player
Approximation algorithm for fair stochastic maximum coverage problem
Efficient counting of square substrings in a tree
Algorithms for generalized vertex-rankings of partial k-trees
Algorithms for gerrymandering over graphs
A Calculational Approach to Mathematical Induction
Analysis of set-up time models: A metric perspective
The unpaired many-to-many k -disjoint paths in bipartite hypercube-like networks
On competitive recommendations
A non-learnable class of E-pattern languages
Pairwise rearrangement is fixed-parameter tractable in the Single Cut-and-Join model
On Elementary Computability-Theoretic Properties of Algorithmic Randomness
Robust self-stabilizing weight-based clustering algorithm
Synthesising succinct strategies in safety games with an application to real-time scheduling
A complexity trichotomy for k-regular asymmetric spin systems with complex edge functions
Fixed Point Characterization of Infinite Behavior of Finite-State Systems
Strong cliques in diamond-free graphs
An Algebraic Interpretation of the lambda beta K-Calculus; and an Application of a Labelled lambda -Calculus
The expressive power of valued constraints: Hierarchies and collapses
On the parameterized complexity of the synthesis of Boolean nets with restricted place environments
Program Size Restrictions in Computational Learning
Strong matching preclusion number of graphs
The fault-tolerant capacitated K-center problem
An upper bound for the circuit complexity of existentially quantified Boolean formulas
Codes, unambiguous automata and sofic systems
Reduction from three-dimensional discrete tomography to multicommodity flow problem
Foreword: Genome Informatics
Refactoring and representation independence for class hierarchies
The closure properties on real numbers under limits and computable operators
Synchronizing finite automata on Eulerian digraphs
The discrete Voronoi game in a simple polygon
Long words: the theory of concatenation and omega-power
A unique secure multimodal biometrics-based user anonymous authenticated key management protocol (SMUAAKAP) based on block chain mechanism for generic HIoTNs
Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations
Size lower bounds for quantum automata
Compositions of maximal codes
On decidability properties of local sentences
Partition arguments in multiparty communication complexity
An accelerated deterministic algorithm for maximizing monotone submodular minus modular function with cardinality constraint
On the least number of palindromes contained in an infinite word
Computing on binary strings
Metric dimension of Cayley digraphs of split metacyclic groups
Intersection types and domain operators
On the complexity of working set selection
Perfect (0, ±1)-matrices and perfect bidirected graphs
Swinging types=functions+relations+transition systems
Complexity classes for self-assembling flexible tiles
Special issue on Temporal Representation and Reasoning (TIME 2017)
Unary algebras, semigroups and congruences on free semigroups
On the relationship between ATSP and the cycle cover problem
Clustering to Minimize the Maximum Intercluster Distance
Mellin Transforms and Asymptotics: Finite Differences and Rice's Integrals
Fitting truncated geometric distributions in large scale real world networks
Generalized juntas and NP-hard sets
The price of envy-freeness in machine scheduling
An efficient algorithm for computing bisimulation equivalence
On the Data Type Extension Problem for Algebraic Specifications
On Equality of Multiplicity Sets of Regular Languages
An improved lower bound for approximating minimum GCD multiplier in l infinity norm (GCDM infinity )
Hardness of approximating the Minimum Solutions of Linear Diophantine Equations
Improved approximation algorithms for a bilevel knapsack problem
Almost Every Set in Exponential Time is P-bi-Immune
Single approximation for the biobjective Max TSP
Tight social welfare approximation of probabilistic serial
Extended capabilities for visual cryptography
Node labels in local decision
Workspace theorems for regular-controlled grammars
Hardness results and approximation algorithms for (weighted) paired-domination in graphs
Relation Algebraic Domain Constructions
Optimal embedding of hypercube into cylinder
The Zig-Zag Power Series: A Two-Way Version of the * Operator
Comparing logics for rewriting: rewriting logic, action calculi and tile logic
Maximum weight bipartite matching in matrix multiplication time
The Finiteness of Finitely Presented Monoids
Kernelization and parameterized algorithms for covering a tree by a set of stars or paths
Reoptimization in machine scheduling
Canonical scattered context generators of sentences with their parses
Computational Depth and Reducibility
Collage system: a unifying framework for compressed pattern matching
The algorithmic complexity of mixed domination in graphs
A ϕ -competitive algorithm for collecting items with increasing weights from a dynamic queue
On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings. III. Optimal Algorithms for the Computation of xy and xy where x, y in M2(K)
An efficient algorithm for the longest common palindromic subsequence problem
Editorial to the special issue on "Theoretical Foundations of Evolutionary Computation"
I/O-optimal categorical 3-sided skyline queries
Three research directions in non-uniform cellular automata
Fully dynamic representations of interval graphs
On the Complexity of Deciding fair Termination of Probabilistic Concurrent Finite-State Programs
A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
(g 0, g 1, ... g k)-Trees and Unary OL Systems
Distance transform computation for digital distance functions
A diagonal-based algorithm for the longest common increasing subsequence problem
A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System
Mutual exclusion as a matter of priority
Quantum clustering with k-Means: A hybrid approach
Going weighted: Parameterized algorithms for cluster editing
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes
Minimum cost perfect matching with delays for two sources
Learned load balancing
Polynomial graph transformability
(Arc-)disjoint flows in networks
String compression in FA-presentable structures
A general framework for searching on a line
Resistance distances in directed graphs: Definitions, properties, and applications
Data Structures for Two-Edge Connectivity in Planar Graphs
Comparison between parallel and serial dynamics of Boolean networks
On Total Functions, Existence Theorems and Computational Complexity
A tight lower bound for the capture time of the Cops and Robbers game
Parsing Schemata and Correctness of Parsing Algorithms
Problem-Oriented Verification System and its Application to Linear Algebra Programs
Axiomatising weak bisimulation congruences over CCS with left merge and communication merge
Resolution based algorithms for the transversal hypergraph generation problem
Error-detecting properties of languages
Corrigendum to "A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem" [Theor. Comput. Sci. 943 (2023) 121-130]
The k-distinct language: Parameterized automata constructions
A transformation algorithm to construct a rectangular floorplan
Examples of Undecidable Problems for 2-Generator Matrix Semigroups
On the p-Isomorphism Conjecture
DESN: An unsupervised MR image denoising network with deep image prior
Complexity of Optimal Vector Code Generation
Finding the Intersection of two Convex Polyhedra
A Recursive and a Grammatical Characterization of the Exponential-Time Languages
On the bandwidth of a Hamming graph
Faster parameterized algorithm for r-pseudoforest deletion
Improved Limitedness Theorems on Finite Automata with Distance Functions
Inapproximability of dominating set on power law graphs
polish - Let us play the cleaning game
The extra connectivity and extra diagnosability of regular interconnection networks
On the average-case complexity of pattern matching with wildcards
On the Power of Alternation on Reversal-Bounded Alternating Turing Machines with a Restriction
On deciding synchronizability for asynchronously communicating systems
Fooling a two Way Automaton or one Pushdown Store is better than one Counter for two Way Machines
Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions
A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties
The structure of subword graphs and suffix trees of Fibonacci words
Coordinating action systems
A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
Well-behaved flow event structures for parallel composition and action refinement
Modeling dependencies and simultaneity in membrane system computations
The Turing Degree of the Inherent Ambiguity Problem for Context-Free Languages
Almost complete sets
The Dependent Product Construction in Various Categories of Domains
On pseudorandomness and resource-bounded measure
Improved algorithm for the locating-chromatic number of trees
Equivalence of Computations in Actor Grammars
A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience
Optimal Fixedpoints of Logic Programs
Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
Optimal construction of k-nearest-neighbor graphs for identifying noisy clusters
The worst-case time complexity for generating all maximal cliques and computational experiments
Testing Equivalences for Processes
A generalization of the language of ukasiewicz coding rooted planar hypermaps
Pseudospectra of exponential matrix polynomials
Solving Linear, Min and Max Constraint Systems Using CLP Based on Relational Interval Arithmetic
Almost envy-freeness in group resource allocation
On MultiAspect graphs
A relation - algebraic approach to the region connection calculus
Flexible High-Order Discretization of Geometric Data for Global Motion Planning
On the non-termination of M-based abstract state enumeration
Complete symbolic reachability analysis using back-and-forth narrowing
On complexity of grammars related to the safety problem
P systems with evolutional symport and membrane creation rules solving QSAT
The approximability of non-Boolean satisfiability problems and restricted integer programming
On Completeness of Narrowing Strategies
Covering the edges of bipartite graphs using K 2, 2 graphs
The accelerated k-in-a-row game
Topology in information theory in topology
The non-parametrizability of the word equation xyz = zvx : A short proof
Explaining updates by minimal sums
Correctness Proofs of CSP Programs
Sorting Twice Through a Stack
A (probably) optimal algorithm for Bisection on bounded-treewidth graphs
Local time membrane systems and time Petri nets
Optimal skeleton and reduced Huffman trees
Fault-free cycles embedding in folded hypercubes with F 4
Soft constraint abstraction based on semiring homomorphism
Picture Words with Invisible Lines
On size reduction techniques for multitape automata
Bounds on Herman's algorithm
Computational topology: ambient isotopic approximation of 2-manifolds
On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
Nonuniform Proof Systems: A New Framework to Describe Nonuniform and Probabilistic Complexity Classes
Complexity of some arc-partition problems for digraphs
Minimization strategies for maximally parallel multiset rewriting systems
Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti
On the string matching with k mismatches
Parallel QR processing of Generalized Sylvester matrices
Theory of Genetic Algorithms II: models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling
Extension of Combinatory Logic to a Theory of Combinatory Representation
Improving the Hadamard extractor
Contention-sensitive data structures and algorithms
Algorithms for k-meet-semidistributive lattices
Uniquely decodable n-gram embeddings
Basing cryptographic protocols on tamper-evident seals
Extracting powers and periods in a word from its runs structure
Reducing price of anarchy of selfish task allocation with more selfishness
On the complexity of the vector connectivity problem
How to normalize the Jay
Intersection Types for Combinatory Logic
Language Complexity of Rotations and Sturmian Sequences
On a Characterization of Pushdown Permuters
Computing role assignments of chordal graphs
A loopless algorithm for generating multiple binary tree sequences simultaneously
The expected asymptotical ratio for preemptive stochastic online problem
Execution trace sets for real computation
Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete
On the expressive power of first-order boolean functions in PCF
Uniform unweighted set cover: The power of non-oblivious local search
Pushing the frontier of minimality
A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting
An Investigation of Controls for Concurrent Systems Based on Abstract Control Languages
Practical and malicious private set intersection with improved efficiency
A new perspective on clustered planarity as a combinatorial embedding problem
Operations and language generating devices suggested by the genome evolution
Syntactic complexity of bifix-free regular languages
A fixpoint theory for non-monotonic parallelism
Recognisability for algebras of infinite trees
Backbone coloring of planar graphs for C8-free or C9-free
Corrigendum to "Incidence coloring on hypercubes" [Theoret. Comput. Sci. 557 (2014) 59-65]
Computational complexity of traffic hijacking under BGP and S-BGP
A proof theoretic view of spatial and temporal dependencies in biochemical systems
Complexity of graph self-assembly in accretive systems and self-destructible systems
A modular analysis of adaptive (non-)convex optimization: Optimism, composite objectives, variance reduction, and variational bounds
On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes
A best on-line algorithm for single machine scheduling with small delivery times
Memoryless determinacy of parity and mean payoff games: a simple proof
On blockwise symmetric signatures for matchgates
Permutability of Proofs in Intuitionistic Sequent Calculi
On final coalgebras of continuous functors
On critical exponents in fixed points of non-erasing morphisms
Abelian complexity of infinite words associated with quadratic Parry numbers
On probabilistic snap-stabilization
Static analysis based on formal models and incremental computation in Go programming
Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost
On the minimum monochromatic or multicolored subgraph partition problems
L-systems for the boundaries of plane-filling folding curves
Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
Formalizing mathematics in higher-order logic: A case study in geometric modelling
Behavioral abstraction is hiding information
The impact of mobility on the geocasting problem in mobile ad-hoc networks: Solvability and cost
A quadratic identity for the number of perfect matchings of plane graphs
On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials Over Finite Fields
Termination of term rewriting using dependency pairs
Asymptotic Analysis of Product-Form Distributions Related to Large Interconnection Networks
Proof Systems for Satisfiability in Hennessy-Milner Logic with Recursion
Alphabetic and synchronized tree transducers
On local times of Martin-Löf random Brownian motion
Generation problems
Eternally dominating large grids
Towards a dynamical model for wireless sensor networks
Combinatorics on words
On the complexity of minimizing energy consumption of partitioning DAG tasks
Learning algebraic structures from text
Unifying Concurrency Control and Recovery of Transactions with Semantically Rich Operations
Counter based suffix tree for DNA pattern repeats
Dynamic Algorithms in D.E. Knuth's Model: A Probabilistic Analysis
Lower bounds and the hardness of counting properties
Determining membership with 2 simultaneous queries
A characterisation of P by DLOGTIME-uniform families of polarizationless P systems using only dissolution rules
Give me some slack: Efficient network measurements
Separating NC along the delta axis
Programs as Partial Graphs I: Flow Equivalence and Correctness
Remarks on the Complexity of Nondeterministic Counter Languages
First-Order Spectra with one Binary Predicate
Some Lowness Properties and Computational Complexity Sequences
Relational Algebraic Semantics of Deterministic and Nondeterministic Programs
Decision trees with short explainable rules
Conditional Kolmogorov complexity and universal probability
Population protocols with faulty interactions: The impact of a leader
Games for the mu-Calculus
Do balanced words have a short period?
A decidability result for the dominating set problem
Distance problems within Helly graphs and k -Helly graphs
Every Free Algebra in the Variety Generated by the Representable Dynamic Algebras is Separable and Representable
Hierarchical design of fast Minimum Disagreement algorithms
Efficient generation of the ideals of a poset in gray code order, part II
Relations Between Diagonalization, Proof Systems, and Complexity Gaps
Results on Homomorphic Realization of Automata by alpha_0-Products
Security levels in steganography - Insecurity does not imply detectability
Specification Styles in Distributed Systems Design and Verification
Probabilistic rely-guarantee calculus
Isolation concepts for efficiently enumerating dense subgraphs
From Hadamard expressions to weighted rotating automata and back
Bounded disagreement
Non-local estimators: A new class of multigrid convergent length estimators
Extricating web pages from deep web using deaima architecture
UAV-based sweep coverage for time-sensitive targets with restricted visible areas
Shell sort with expected complexity of O(nlog2n)
Near-Optimal, Distributed Edge Colouring via the Nibble Method
Parameterized computational complexity of control problems in voting systems
Church-Rosser Theorem for a Rewriting System on Categorical Combinators
A Note on the Existence of Continuous Functionals
Further results on generalised communicating P systems
The Reduced Relative Power Operation on Abstract Domains
On the Decidability of Process Equivalences for the pi-Calculus
A new lattice-based online/offline signatures framework for low-power devices
Improved Lower Bounds for the Cycle Detection Problem
Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
The generic construction of continuous leakage-resilient identity-based cryptosystems
Decidability of EDT0L structural equivalence
A Note on Binary Grammatical Codes of Trees
Time optimal gathering of myopic robots on an infinite triangular grid
A guide to membrane computing