yusuke1997/dblp-id-title huggingface dataset:
Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs
Quadratic Programming and Combinatorial Minimum Weight Product Problems
Almost-Catalytic Computation
Randomized Adaptive Test Cover
On the Lovász Number of Certain Circulant Graphs
Asynchronous Fully-Decentralized SGD in the Cluster-Based Model
Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems
Differential Approximation for Some Routing Problems
Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings
Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs
Parallel Pruning Decomposition (PDS) and Biconnected Components of Graphs
Network Discovery and Verification with Distance Queries
Speeding Up Pattern Matching by Text Compression
Polynominal Time Algorithms for Some Self-Duality Problems
Unit Refutations in Horn Constraint Systems
Minimum-Link C-Oriented Paths Visiting a Sequence of Regions in the Plane
The Independence Number of Random Interval Graphs
The Online Dial-a-Ride Problem under Reasonable Load
A Planar Linear Arboricity Conjecture
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond
How Simple Robots Benefit from Looking Back
A Meticulous Analysis of Mergesort Programs
Finding a Mediocre Player
Algorithms and Complexity - 14th International Conference, CIAC 2025, Rome, Italy, June 10-12, 2025, Proceedings, Part I
Parameterized Complexity of Disconnected Matchings
Design of Reliable Combinatorial Algorithms Using Certificates
Computational Complexity of Combinatorial Distance Matrix Realisation
Communication Requirements for Stable Marriages
Approximation Algorithms for Disjoint st -Paths with Minimum Activation Cost
Algorithms and Complexity - 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings
Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines
Congestion Games with Complementarities
Globally Rigid Augmentation of Minimally Rigid Graphs in R 2
New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems
Stable Scheduling in Transactional Memory
Tracking Paths
Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas
An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences
Algorithms for Energy Conservation in Heterogeneous Data Centers
A Parameterized Perspective of All-Colors
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy
Group Updates for Red-Black Trees
Linear Search with Terrain-Dependent Speeds
Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction Items
Algorithms and Complexity, 4th Italian Conference, CIAC 2000, Rome, Italy, March 2000, Proceedings
Improved Sublinear-Time Moment Estimation Using Weighted Sampling
A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths
Atoms Versus Avoiding Simplicial Vertices
Fast Cauchy Sum Algorithms for Polynomial Zeros and Matrix Eigenvalues
Graph Theory and Interactive Protocols for Reachability Problems on Finite Cellular Automata
Embedding Interconnection Networks in Grids via the Layered Cross Product
Subset Feedback Vertex Set in Chordal and Split Graphs
Cliques and Clubs
The Temporal Explorer Who Returns to the Base
FPT and Kernelization Algorithms for the Induced Tree Problem
The Power of the Binary Value Principle
Algorithms and Data Structures for Control Dependence and Related Compiler Problems
Approximating Power Node-Deletion Problems
A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance
Block Sorting Is APX-Hard
Mechanisms for the Marriage and the Assignment Game
On the Complexity of Some Reachability Problems
Tree Contractions and Evolutionary Trees
Deciding the FIFO Stability of Networks in Polynomial Time
Supereulerian Testing on Semi-Eulerian Graphs
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability (Extended Abstract)
The Weisfeiler-Leman Algorithm and Recognition of Graph Properties
Finding All Convex Cuts of a Plane Graph in Cubic Time
Complexity of Scheduling for DARP with Soft Ride Times
Lower Bounds for Merging on the Hypercube
Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory
Exact and Approximate High-Multiplicity Scheduling on Identical Machines
The Complexity of Detecting Fixed-Density Clusters
On the Complexity of Finding a Potential Community
A New Dynamic Graph Structure for Large-Scale Transportation Networks
Longest Path Transversals in Claw-Free and P 5 -Free Graphs
Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds
Algorithms Solving the Matching Cut Problem
The Complexity of Landmark Hub Labeling
Subgraph Isomorphism on Graph Classes that Exclude a Substructure
Parameterized Resiliency Problems via Integer Linear Programming
TFNP: An Update
Approximation Algorithms for Capacitated Rectangle Stabbing
Temporal Matching on Geometric Graph Data
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
Efficiently Testing T -Interval Connectivity in Dynamic Graphs
Extending Partial Representations of Rectangular Duals with Given Contact Orientations
Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations
Gathering Algorithms on Paths Under Interference Constraints
The Online-TSP against Fair Adversaries
On the Price of Anarchy in Packet Routing Games with FIFO
Optimal Binary Search Trees with Costs Depending on the Access Paths
Label Placement in Road Maps
Parameterizing Path Partitions
Completeness Results for Counting Problems with Easy Decision
Arithmetic Circuits with Division
Nearly Bounded Error Probabilistic Sets
Money-Based Coordination of Network Packets
On Removing Non-degeneracy Assumptions in Computational Geometry
On the Minimum Common Integer Partition Problem
Almost Optimal Cover-Free Families
A Lex-BFS-Based Recognition Algorithm for Robinsonian Matrices
Algorithms for a Simple Point Placement Problem
Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems
Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
Maximum Flows in Parametric Graph Templates
List Coloring in the Absence of Two Subgraphs
Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number
Hyper Encryption and Everlasting Secrets
Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation
Online Cooperative Cost Sharing
Colouring Graphs of Bounded Diameter in the Absence of Small Cycles
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs
Approximate Maximin Share Allocations in Matroids
Improved Bounds for Geodetic Hulls
On Exact Learning of d-Monotone Functions
Efficient Update Strategies for Geometric Computing with Uncertainty
The Complexity of Computing Minimal Unidirectional Covering Sets
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering
Nonpartisan Feedback Vertex Set
Approximating SVP infty to within Almost-Polynomial Factors Is NP-Hard
The Multi-budget Maximum Weighted Coverage Problem
Preprocessing Speed-Up Techniques Is Hard
Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems
Unlocking the Advantages of Dynamic Service Selection and Pricing
Capacitated Confluent Flows: Complexity and Algorithms
Competitive Strategies for Online Clique Clustering
Enumerating Rooted Graphs with Reflectional Block Structures
Maintaining Maxima under Boundary Updates
Optimal Network Decontamination with Threshold Immunity
On the Hardness of Range Assignment Problems
Efficient Reorganization of Binary Search Trees
Black Hole Search in Asynchronous Rings Using Tokens
Faster Exact Solutions for MAX2SAT
Assessing the Computational Complexity of Multi-layer Subgraph Detection
Topological Chaos for Elementary Cellular Automata
Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem
Semantical Counting Circuits
QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms
The Complexity of Secure RAMs
The Relative Worst Order Ratio for On-Line Algorithms
Contraction Blockers for Graphs with Forbidden Induced Paths
Stathis Zachos at 70!
Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings
Upper Tail Analysis of Bucket Sort and Random Tries
Computing with Electronic Nanotechnologies
Structural Parameters for Scheduling with Assignment Restrictions
Fragile Complexity of Adaptive Algorithms
The Linear Arrangement Problem Parameterized Above Guaranteed Value
Broadcasting in Split Graphs
Improved Bounds for Group Testing in Arbitrary Hypergraphs
LP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem
Online Range Assignment Problems
An Improved Algorithm for Point Set Pattern Matching under Rigid Motion
New Algorithmic Results for Bin Packing and Scheduling
Covering a Set of Line Segments with a Few Squares
Planarity of Streamed Graphs
Capacitated Rank-Maximal Matchings
An Opportunistic Text Indexing Structure Based on Run Length Encoding
Tatami Printer: Physical ZKPs for Tatami Puzzles
On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves
On the Number of Higher Order Delaunay Triangulations
Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints
An Improved Deterministic Algorithms for Generalized Random Sampling
How to Pack Directed Acyclic Graphs into Small Blocks
In-Place Randomized Slope Selection
On a Parallel-Algorithms Method for String Matching Problems
Realizing Graphs with Cut Constraints
Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling
The Hardness of Placing Street Names in a Manhattan Type Map
On Two Simple[st] Learning Tasks
An Exact Algorithm for Connected Red-Blue Dominating Set
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms
Average Optimal String Matching in Packed Strings
Scheduling with Gaps: New Models and Algorithms
Packing Dimers to Maximum Occupancy Under Soft-Core Constraints
On the Intellectual Terrain Around NP
On the Hardness of the Drone Delivery Problem
Complexity of Barrier Coverage with Relocatable Sensors in the Plane
Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games
The Parameterized Position Heap of a Trie
Improved Approximations for TSP with Simple Precedence Constraints
Resilient Algorithms and Data Structures
A Greedy Approximation Algorithm for Minimum-Gap Scheduling
Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set
Quadratic Vertex Kernel for Split Vertex Deletion
Area Requirement of Gabriel Drawings
Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates
A Near Optimal Scheduler for On-Demand Data Broadcasts
Extension of Vertex Cover and Independent Set in Some Classes of Graphs
On One-Sided Testing Affine Subspaces
A Multistage View on 2-Satisfiability
Pinwheel Covering
A Parameterized Algorithm for Chordal Sandwich
Phylogenetic Networks, A Way to Cope with Complex Evolutionary Processes
Parameterized Complexity of Even/Odd Subgraph Problems
Approximation Hardness for Small Occurrence Instances of NP-Hard Problems
Enumeration of Minimal Tropical Connected Sets
Online Strategies for Backups
Weak Coverage of a Rectangular Barrier
Scheduling Maintenance Jobs in Networks
Decentralized Throughput Scheduling
Parameterized Complexity of Safe Set
On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs
Searching by Heterogeneous Agents
On the Complexity of Wafer-to-Wafer Integration
Phase Transition in Count Approximation by Count-Min Sketch with Conservative Updates
A Faster Algorithm for the Strongly Stable b-Matching Problem
Minimum Cost Perfect Matching with Delays for Two Sources
Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings
On the Discrete and Semi-continuous Versions of the Two-Watchtower Problem in the Plane
The Optimum Cost Chromatic Partition Problem
Approximating Bounded Degree Deletion via Matroid Matching
Exact and Parameterized Algorithms for Window Width Minimization in Bipartite Arrangement
Minimum Convex Partition of Point Sets
R SN 1-tt (NP) Distinguishes Robust Many-One and Turing Completeness
Three Problems on Well-Partitioned Chordal Graphs
Can Local Optimality Be Used for Efficient Data Reduction?
Independent Lazy Better-Response Dynamics on Network Games
Competitive Online Clique Clustering
Learning Behaviors of Automata from Multiplicity and Equivalence Queries
Minimum Point-Overlap Labeling
An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons
Duality in ATM Layout Problems
Generating All Forest Extensions of a Partially Ordered Set
Some Properties of MOD m Circuits Computing Simple Functions
On The Computational Complexity of Games with Uncertainty
Algorithms and Complexity, Third Italian Conference, CIAC '97, Rome, Italy, March 12-14, 1997, Proceedings
Communication, Dynamics, and Renormalization
How Vulnerable is an Undirected Planar Graph with Respect to Max Flow
Linear-Time In-Place DFS and BFS on the Word RAM
On Strategy Improvement Algorithms for Simple Stochastic Games
Algorithms and Complexity - 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings
Linear Time Constructions of Some d -Restriction Problems
Perpetually Dominating Large Grids
Vertex Deletion on Split Graphs: Beyond 4-Hitting Set
On the Combinatorial Power of the Weisfeiler-Lehman Algorithm
Happy Set Problems on Cubic Graphs and Convex Bipartite Graphs
Covering a Set of Points with a Minimum Number of Lines
Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems
Finding the Maximum Suffix with Fewer Comparisons
A New NC-Algorithm for Finding a Perfect Matching in d -Regular Bipartite Graphs When d Is Small
Dynamic Filter and Retrieval with One Access to Modifiable Memory
Improved Lower Bounds for Graph Embedding Problems
Sparse Linear Complementarity Problems
Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes
Hardness of Approximating Problems on Cubic Graphs
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality
k -cuts on a Path
Paths to Trees and Cacti
The Parameterized Suffix Tray
Collaboration Without Communication: Evacuating Two Robots from a Disk
Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation
Complexity of Vertex Switching on Edge-Bicolored Graphs
Subsequence Matching and LCS with Segment Number Constraints
On-Line Stream Merging, Max Span, and Min Coverage
XOR-Based Schemes for Fast Parallel IP Lookups
On Search Problems in Complexity Theory and in Logic (Abstract)
A Non-Iterative Electronic Cash System
Circumventing Connectivity for Kernelization
Finding Optimum k -vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for k =3, 4, 5
The Impact of Network Structure on the Stability of Greedy Protocols
Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings
Universal Relations and #P-Completeness
MinMax-Distance Gathering on Given Meeting Points
Indexing Structures for Approximate String Matching
Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings
Communication-Efficient Distributed Graph Clustering and Sparsification Under Duplication Models
Spanning Trees with Low Maximum/Average Stretch
Fault Tolerant K-Center Problems
Dynamic Coloring on Restricted Graph Classes
Disjoint Temporal Walks Under Waiting Time Constraints
The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality
End-Vertices of Graph Search Algorithms
Four Measures of Nonlinearity
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Approximation of a Retrieval Problem for Parallel Disks
On-Line Coloring of H-Free Bipartite Graphs
Selfish Resource Allocation in Optical Networks
Efficient Certifying Algorithms for Linear Classification
Sharing Non-anonymous Costs of Multiple Resources Optimally
Irredundant Set Faster Than O (2 n )
On Set Equality-Testing
Popular Matchings in the Marriage and Roommates Problems
Modified Binary Searching for Static Tables
Strategic Coloring of a Graph
Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown
On Sets with Easy Certificates and the Existence of One-Way Permutations
Truthful Many-to-Many Assignment with Private Weights
Efficiently Enumerating All Spanning Trees of a Plane 3-Tree - (Extended Abstract)
Deciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-Complete
Enumeration of Maximal Irredundant Sets for Claw-Free Graphs
On the Drift of Short Schedules
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem
Isomorphism for Graphs of Bounded Distance Width
On Salesmen, Repairmen, Spiders, and Other Traveling Agents
Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements
Partitioning Subclasses of Chordal Graphs with Few Deletions
Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games
Discrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive vs. Offline
On the Power of Nodes of Degree Four in the Local Max-Cut Problem
Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors
Perpetual Scheduling with Explorable Uncertainty
Parameterized Complexity of Diameter
A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering
Network Creation Games with 2-Neighborhood Maximization
PSPACE-Completeness of Bloxorz and of Games with 2-Buttons
Distributed Distance-r Covering Problems on Sparse High-Girth Graphs
Branching Programs with Extended Memory: New Insights
Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete
Burning Path-Like and Clique-Like Graphs
"Green" Barrier Coverage with Mobile Sensors
New Results on Stabbing Segments with a Polygon
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders
Parameterized Complexity and Kernel Bounds for Hard Planning Problems
CP with Architectural State Lookup for Functional Test Generation
An approach to approximate computing: Logic transformations for one-minterm changes in specification
Toward automated abstraction for protocols on branching networks
IEEE International High Level Design Validation and Test Workshop, HLDVT 2010, Anaheim, CA, USA, 10-12 June 2010
Special session - What's so intelligent about testbenches?
TRANS: efficient sequential verification of loop-free circuits
Accelerated verification of RTL assertions based on satisfiability solvers
Learning from constraints for formal property checking
Ninth IEEE International High-Level Design Validation and Test Workshop 2004, Sonoma Valley, CA, USA, November 10-12, 2004
Timed HW-SW cosimulation using native execution of OS and application SW
Test Directive Generation for Functional Coverage Closure Using Inductive Logic Programming
Improving feasible interactions among multiple processes
Log2model: inferring behavioral models from log data
Evaluation of an efficient control-oriented coverage metric
A versatile scheme for the validation, testing and debugging of High Speed Serial Interfaces
Janus: A novel use of Formal Verification for targeted behavioral equivalence
Validation of the dependability of CAN-based networked systems
Post-silicon code coverage evaluation with reduced area overhead for functional verification of SoC
Behavior Driven Development for circuit design and verification
High-level optimization of pipeline design
Accurate profiling of oracles for self-checking time-constrained embedded software
Equivalence Checking with Rule-Based Equivalence Propagation and High-Level Synthesis
A hierarchical approach for designing dependable systems
Energy aware TLM platform simulation via RTL abstraction
Introducing XCS to Coverage Directed test Generation
Relating buffer-oriented microarchitecture validation to high-level pipeline functionality
Automating defects simulation and fault modeling for SRAMs
Constraints specification at higher levels of abstraction
Single-source hardware modeling of different abstraction levels with State Charts
Automatic generation of transducer models for multicore system design
Logic transformation and coding theory-based frameworks for Boolean satisfiability
Generating concurrent test-programs with collisions for multi-processor verification
Test pattern generation for timing-induced functional errors in hardware-software systems
Observability enhanced coverage analysis of C programs for functional validation
Multilevel design validation in a secure embedded system
Injecting intermittent faults for the dependability validation of commercial microcontrollers
Guiding CNF-SAT Search by Analyzing Constraint-Variable Dependencies and Clause Lengths
A novel methodology for hierarchical test generation using functional constraint composition
SyQUAL: a platform for qualitative modelling and simulation of biological systems
Utilizing GPGPUs for design validation with a modified Ant Colony Optimization
Scheduling of transactions for system-level test-case generation
Matching in the presence of don't cares and redundant sequential elements for sequential equivalence checking
Panel: Unified approach leading to a seamlessly evolving test bench for all phases of a multi-core design, validation and production test
Experience with term level modeling and verification of the M*CORE TM microprocessor core
Panel: Assertion-Based Verification -What's the Big Deal?
System level testability analysis using Petri nets
Alignability equivalence of synchronous sequential circuits
Use of constraint solving in order to generate test vectors for behavioral validation
Automated test generation for post silicon microcontroller validation
High-level test generation for hardware testing and software validation
Panel: What happened to the intelligent test bench?
Coverage-directed test generation through automatic constraint extraction
A HW/SW co-simulation framework for the verification of multi-CPU systems
Reachability analysis in RTL circuits using k-induction bounded model checking
Scalable defect mapping and configuration of memory-based nanofabrics
Estimation of formal verification cost using regression machine learning
State space reductions for scalable verification of asynchronous designs
IChecker: An Efficient Checker for Inductive Invariants
Quick formal modeling of communication fabrics to enable verification
Formal verification of pipelined processors with load-value prediction
Fault injection ecosystem for assisted safety validation of automotive systems
Using live sequence charts for hardware protocol specification and compliance verification
Automatic generation of Verilog bus transactors from natural language protocol specifications
High level fault simulation: experiments and results on ITC'99 benchmarks
Fault table generation using Graphics Processing Units
Bug analysis and corresponding error models in real designs
Circuit design and verication with Esterel v7 and Esterel Studio
A method for the evaluation of behavioral fault models
Increasing the deducibility in CNF instances for efficient SAT-based bounded model checking
Verification of composite Galois field multipliers over GF ((2 m ) n ) using computer algebra techniques
Automated Coverage Directed Test Generation Using a Cell-Based Genetic Algorithm
A scalable hybrid verification system based on HDL slicing
High-level vulnerability over space and time to insidious soft errors
Genetic algorithms: the philosopher's stone or an effective solution for high-level TPG?
Silicon debug of a co-processor array for video applications
Chairs' welcome message