yusuke1997/dblp-id-title huggingface dataset:
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data
An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem
SPIDER: Improved Succinct Rank and Select Performance
Evaluation of Online Strategies for Reordering Buffers
The Steiner Multi Cycle Problem with Applications to a Collaborative Truckload Problem
Computing Nonsimple Polygons of Minimum Perimeter
Evaluating and Tuning n-fold Integer Programming
CompDP: A Framework for Simultaneous Subgraph Counting Under Connectivity Constraints
Move-r: Optimizing the r-index
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
Efficient and Practical Tree Preconditioning for Solving Laplacian Systems
Distributed Circle Formation for Anonymous Oblivious Robots
Efficient Wavelet Tree Construction and Querying for Multicore Architectures
Trunk Packing Revisited
Partitioning Graphs to Speed Up Dijkstra's Algorithm
Advanced Flow-Based Multilevel Hypergraph Partitioning
Solving k-means on High-Dimensional Big Data
Engineering Fused Lasso Solvers on Trees
Accelerating Local Search for the Maximum Independent Set Problem
Fast Exact Computation of Isochrones in Road Networks
Experimental Comparisons of Derivative Free Optimization Algorithms
Dictionaries Revisited
An Experimental Study of Stability in Heterogeneous Networks
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
A New Combinational Logic Minimization Technique with Applications to Cryptology
Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks
Zipping Segment Trees
Finding the Minimum Cost Acceptable Element in a Sorted Matrix
Experimental Algorithms, 8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings
Document Retrieval Hacks
Computing Multimodal Journeys in Practice
Dynamizing Succinct Tree Representations
Approximability of Symmetric Bimatrix Games and Related Experiments
Experimental Studies of Symbolic Shortest-Path Algorithms
Column Generation Based Heuristic for a Helicopter Routing Problem
Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances
Online Dictionary Matching with Variable-Length Gaps
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
Updating Directed Minimum Cost Spanning Trees
Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure
An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic
When to Reap and When to Sow - Lowering Peak Usage with Realistic Batteries
Maximum Cliques in Protein Structure Comparison
Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment
Reducing Splaying by Taking Advantage of Working Sets
Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability Problem
Fast Scalable Construction of (Minimal Perfect Hash) Functions
An Experimental Study of Unranking Algorithms
How Good Are Popular Matchings?
Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders
Experimental Algorithms, 5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006, Proceedings
Time-Dependent Contraction Hierarchies and Approximation
Compact Relaxations for Polynomial Programming Problems
Better Landmarks Within Reach
Restructuring Expression Dags for Efficient Parallelization
Some Advances in the Theory of Voting Systems Based on Experimental Algorithms
A Cut-Based Heuristic to Produce Almost Feasible Periodic Railway Timetables
Finding Robust Solutions for the Stochastic Job Shop Scheduling Problem by Including Simulation in Local Search
Linear Algorithm for 3-Coloring of Locally Connected Graphs
Is Nearly-linear the Same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver
An Improved Branch-and-Bound Algorithm for the Test Cover Problem
A Parallel Multi-start Search Algorithm for Dynamic Traveling Salesman Problem
A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs
Metaheuristic Optimization: Algorithm Analysis and Open Problems
An Exact Algorithm for the Discrete Chromatic Art Gallery Problem
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Fast Reachability Using DAG Decomposition
Simple and Efficient Geographic Routing Around Obstacles for Wireless Sensor Networks
Experiments with a Feasibility Pump Approach for Nonconvex MINLPs
An Empirical Study of Finding Approximate Equilibria in Bimatrix Games
Experimental Algorithms, 7th International Workshop, WEA 2008, Provincetown, MA, USA, May 30-June 1, 2008, Proceedings
Efficient and Accurate Group Testing via Belief Propagation: An Empirical Study
An Experimental Study of External Memory Algorithms for Connected Components
Fast Algorithms for Weighted Bipartite Matching
Practical Implementation of Encoding Range Top-2 Queries
Parallel Construction of Succinct Trees
Retrieval and Perfect Hashing Using Fingerprinting
A Distributed Primal-Dual Heuristic for Steiner Problems in Networks
Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases
Computing Elevation Maxima by Searching the Gauss Sphere
Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere
Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm
An Application of Self-organizing Data Structures to Compression
Data Propagation with Guaranteed Delivery for Mobile Networks
New Upper Bound Heuristics for Treewidth
16th International Symposium on Experimental Algorithms, SEA 2017, London, UK, June 21-23, 2017
A Branch-and-Price Algorithm for Multi-mode Resource Leveling
Compression with the tudocomp Framework
Improved Cut Strategy for Tensor Network Contraction Orders
Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks
A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions
Variable Shift SDD: A More Succinct Sentential Decision Diagram
Comparative Experiments with GRASP and Constraint Programming for the Oil Well Drilling Problem
Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study
Better Partitions of Protein Graphs for Subsystem Quantum Chemistry
Dynamic Quality of Service Support in Virtual Private Networks
Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow
Planar Network Diversion
Fast matching statistics in small space
Layer-Free Upward Crossing Minimization
Worst-Case-Efficient Dynamic Arrays in Practice
The Effect of Almost-Empty Faces on Planar Kandinsky Drawings
Advanced Coarsening Schemes for Graph Partitioning
The Necessity of Timekeeping in Adversarial Queueing
Fast Computation of Shortest Smooth Paths and Uniformly Bounded Stretch with Lazy RPHAST
Incremental Reachability Index
Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows
An Ambiguous Coding Scheme for Selective Encryption of High Entropy Volumes
Solving Chance-Constrained Programs Combining Tabu Search and Simulation
Continuous Map Matching to Paths Under Travel Time Constraints
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches
CluStRE: Streaming Graph Clustering with Multi-Stage Refinement
Practical Nearest Neighbor Search in the Plane
Algorithms for Longer OLED Lifetime
Fast Succinct Retrieval and Approximate Membership Using Ribbon
Random Models for Geometric Graphs (Abstract)
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness
Dynamic Application Placement Under Service and Memory Constraints
A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation
Efficient Generation of Stable Planar Cages for Chemistry
Improved and Extended Locating Functionality on Compressed Suffix Arrays
Efficient Terabyte-Scale Text Compression via Stable Local Consistency and Parallel Grammar Processing
Dynamic Time-Dependent Route Planning in Road Networks with User Preferences
Linear Time Local Improvements for Weighted Matchings in Graphs
A General Buffer Scheme for the Windows Scheduling Problem
Multi-criteria Shortest Paths in Time-Dependent Train Networks
Practical Construction of k -Nearest Neighbor Graphs in Metric Spaces
Engineering Shortest Path Algorithms
The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation
Fault Cryptanalysis and the Shrinking Generator
Listing All Maximal Cliques in Large Sparse Real-World Graphs
The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm
Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT Algorithm
Engineering Streaming Algorithms
New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint
Pattern Discovery in Colored Strings
Fast Local Search for the Maximum Independent Set Problem
Dynamic Windows Scheduling with Reallocation
Improved ESP-index: A Practical Self-index for Highly Repetitive Texts
Space-Efficient Top-k Document Retrieval
Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces
Ad-Hoc Affectance-Selective Families for Layer Dissemination
A Simple Integer Successor-Delete Data Structure
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms
On Computing the Diameter of (Weighted) Link Streams
Exploiting GPS Data in Public Transport Journey Planners
Core Instances for Testing: A Case Study
Influence of Pruning Devices on the Solution of Molecular Distance Geometry Problems
Fully Dynamic Maintenance of Arc-Flags in Road Networks
GRASP with Path-Relinking for the Quadratic Assignment Problem
A Graph-Theoretic Formulation of Exploratory Blockmodeling
Experimental Algorithms - 14th International Symposium, SEA 2015, Paris, France, June 29 - July 1, 2015, Proceedings
Modularity-Driven Clustering of Dynamic Graphs
Incremental Low-High Orders of Directed Graphs and Applications
Experimental Comparison of Heuristic and Approximation Algorithms for Uncapacitated Facility Location
An Efficient Local Search for the Minimum Independent Dominating Set Problem
Experimental and Efficient Algorithms, Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings
Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach
An Empirical Evaluation of Extendible Arrays
Fast, Small, Simple Rank/Select on Bitmaps
New Lower and Upper Bounds for Graph Treewidth
GRASP with Path-Relinking for the Maximum Diversity Problem
Submodular Minimization in the Context of Modern LP and MILP Methods and Solvers
Space-Efficient, High-Performance Rank and Select Structures on Uncompressed Bit Sequences
On the Satisfiability of Smooth Grid CSPs
Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks
Succinct Rank Dictionaries Revisited
Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory
A Randomized Heuristic for Scene Recognition by Graph Matching
Effect of Initial Assignment on Local Search Performance for Max Sat
3/2-Dual Approximation for CPU/GPU Scheduling
Hybrid SDP Bounding Procedure
Branchless Search Programs
Compact Flow Diagrams for State Sequences
An On-Line Algorithm for the Rectangle Packing Problem with Rejection
Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane
The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm
A Design-for-Yield Algorithm to Assess and Improve the Structural and Energetic Robustness of Proteins and Drugs
Algorithms for the Balanced Edge Partitioning Problem
A Heuristic Strong Connectivity Algorithm for Large Graphs
Fuzzy Clustering the Backward Dynamic Slices of Programs to Identify the Origins of Failure
On Tamaki's Algorithm to Compute Treewidths
Engineering Motif Search for Large Motifs
U-Index: A Universal Indexing Framework for Matching Long Patterns
Faster Fully Dynamic Transitive Closure in Practice
Pangenome Graph Indexing via the Multidollar-BWT
Optimal Competitive Online Ray Search with an Error-Prone Robot
SimdMinimizers: Computing Random Minimizers, fast
Heuristic Computation of Exact Treewidth
An Approximate epsilon -Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem
Cache-, Hash- and Space-Efficient Bloom Filters
Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates
Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation
Finding Structurally and Temporally Similar Trajectories in Graphs
Integer Programming Formulations and Cutting Plane Algorithms for the Maximum Selective Tree Problem
Targeted Branching for the Maximum Independent Set Problem
Experimental Study of Geometric t-Spanners: A Running Time Comparison
Blinking Molecule Tracking
Landmark-Based Routing in Dynamic Graphs
Computing Consensus Curves
Experimental Algorithms - 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings
Evaluation of Labeling Strategies for Rotating Maps
Experimental Evaluation of Approximation and Heuristic Algorithms for Sorting Railway Cars
An Experimental Comparison of Different Heuristics for the Master Bay Plan Problem
Vertex Cover Approximations on Random Graphs
Engineering Insights into Biclique Partitions and Fractional Binary Ranks of Matrices
Tree-Based Coarsening and Partitioning of Complex Networks
Blocked Bloom Filters with Choices
Engineering Fast Route Planning Algorithms
Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees
RLBWT Tricks
Efficient and Experimental Meta-heuristics for MAX-SAT Problems
Adaptive Distributed b-Matching in Overlays with Preferences
Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem
Practical Range Minimum Queries Revisited
psort, Yet Another Fast Stable Sorting Software
A Graph-Based Similarity Approach to Classify Recurrent Complex Motifs from Their Context in RNA Structures
Experimental Analysis of Algorithms for Updating Minimum Spanning Trees on Graphs Subject to Changes on Edge Weights
Towards a Simple and Practical Blockchain Consensus Protocol
Large Language Models for Explainable Threat Intelligence
GATOSTAR: A Fault Tolerant Load Sharing Facility for Parallel Applications
Fault Links: Exploring the Relationship Between Module and Fault Types
A Fast and Efficient Fault Tree Analysis Using Approximate Computing
Geo-Location Inference Attacks: From Modelling to Privacy Risk Assessment (Short Paper)
The Design of a COTSReal-Time Distributed Security Kernel
A New LFSR with D and T Flip-Flops as an Effective Test Pattern Generator for VLSI Circuits
RIFLE: A General Purpose Pin-level Fault Injector
Ultrafast Single Error Correction Codes for Protecting Processor Registers
SGNET: A Worldwide Deployable Framework to Support the Analysis of Malware Threat Models
Towards Safety-Awareness and Dynamic Safety Management
Eighth European Dependable Computing Conference, EDCC-8 2010, Valencia, Spain, 28-30 April 2010
Transforming Byzantine Faults using a Trusted Execution Environment
Dynamic VM Dependability Monitoring Using Hypervisor Probes
Partitioned Embedded Architecture Based on Hypervisor: The XtratuM Approach
A System-Level Architecture for Fine-Grained Privacy Control in Location-Based Services
An Availability Model for DSS and OLTP Applications in Virtualized Environments
Spatial-Temporal Graph Neural Network for Detecting and Localizing Anomalies in PMU Networks
Expert-Guided Automatic Diagnosis of Performance Problems in Enterprise Applications
Failure Detection with Booting in Partially Synchronous Systems
Cluster-Based Vulnerability Assessment Applied to Operating Systems
Combining SAN and P-Graphs for the Analysis and Optimization of Industrial Processes
Compact Two-Dimensional RAID Level 6 Arrays Tolerating Quadruple Node Failures: Extended Abstract
Investigating the Effects of Process Variations and System Workloads on Reliability of STT-RAM Caches
Security of Electrostatic Field Persistent Routing: Attacks and Defense Mechanisms
Software Trustworthiness Assessment via Large Language Models (LLMs)
From Byzantine Consensus to BFT State Machine Replication: A Latency-Optimal Transformation
Processing Web Applications using NLP for Vulnerability Identification
Hardware Runtime Verification of a RTOS Kernel: Evaluation Using Fault Injection
20th European Dependable Computing Conference, EDCC 2025 - Companion Proceedings, Lisbon, Portugal, April 8-11, 2025
ACC Fuzzy-Based Control Architecture for Multi-body High-Speed Trains with Active Inter-cars Couplers
Service-Oriented Reconfiguration in Systems of Systems Assured by Dynamic Modular Safety Cases
A Unified Theory for f 1 /f 2 -Diagnosable Communication Networks
Experimentation of WCET computation on both ends of automotive processor range
Efficient Reliable Real-Time Group Communication for Wireless Local Area Networks
On the Probability of Unsafe Disagreement in Group Formation Algorithms for Vehicular Ad Hoc Networks
Insights from Railway Professionals: Rethinking Railway Assumptions Regarding Safety and Autonomy
Model-Based Dependability Evaluation Method for TTP/C Based Systems
Beyond Attack Trees: Dynamic Security Modeling with Boolean Logic Driven Markov Processes (BDMP)
Integrated Safety in Flexible Manufacturing Systems
Advancing Fault Injection and Dependability Evaluation in the Software-Driven Telecom Industry
Systematic and Design Diversity - Software Techniques for Hardware Fault Detection
Assessment of a Method for Detecting Process Anomalies Using Digital-Twinning
Methodology for Vulnerabilities Detection in IoT Gateways Source Code
Automatic Deduction of the Impact of Context Variability on System Safety Goals
Bringing Independent Cybersecurity Assessments to Space Systems
Hierarchical Test Analysis of VLSI Circuits for Random BIST
Exploiting MDE for Platform-Independent Testing of Service Orchestrations
Assembly-Level Pre-injection Analysis for Improving Fault Injection Efficiency
Safety Cases for Adaptive Systems of Systems: State of the Art and Current Challenges
Proving Safety Properties for Embedded Control Systems
Using Safety Contracts to Guide the Maintenance of Systems and Safety Cases
Machine Learning-Based Distributed Intrusion Detection System in Industrial Edge Environments: Challenge Identification
Runtime Verification of Ethereum Smart Contracts
Towards Efficacy Hypotheses for Safety Cases
19th European Dependable Computing Conference, EDCC 2024, Leuven, Belgium, April 8-11, 2024
Automated Generation of Configurable Cloud-Native Chaos Testbeds
An Experimental Study of Software Aging and Rejuvenation in Dockerd
Towards Continuous Assurance Case Creation for ADS with the Evidential Tool Bus
Facing Cyber-Physical Security Threats by PSIM-SIEM Integration
Exploring Complementarity Between Functional Safety and Cybersecurity in the Chemical Process Industry
18th European Dependable Computing Conference, EDCC 2022, Zaragoza, Spain, September 12-15, 2022
Improving Dependability of Neuromorphic Computing With Non-Volatile Memory
Drafting a Cybersecurity Framework Profile for Smart Grids in EU: A Goal-Based Methodology
Software Reliability Analysis of Three Successive Generations of a Switching System
17th European Dependable Computing Conference, EDCC 2021, Munich, Germany, September 13-16, 2021
Data Management and Privacy in a World of Data Wealth
Muteness Failure Detectors: Specification and Implementation
Extending a security ontology framework to model CAPEC attack paths and TAL adversary profiles
Practical Emulation of Software Defects in Source Code
A Prototype Evaluation of a Tamper-Resistant High Performance Blockchain-Based Transaction Log for a Distributed Database
Empowering Individual Climate Action Through Carbon Tokenization
Novel Use of EO Satellite Data and AI in Railways: A Concept for Rail Buckling Risk Estimation in the SPATRA Project
Synchronisation of On-Board Track Geometry Monitoring Signals to Enable Machine Learning Predictions
On the Impact of Measurement Errors on Loss Calculations in Distribution Grids
On the Meaning of AI Safety
Towards a Common Safety Ontology for Automobiles and Railway Vehicles
Finding Resilience-Friendly Compiler Optimizations Using Meta-Heuristic Search Techniques
Swarm Synthesis of Convergence for Symmetric Protocols
A Single AI Platform for the Unification of Railway Transport Logistics Processes
Generation of Safety and Liveness Complaint Automata from Goal Model Specifications
On the Effects of Cumulative SEUs in FPGA-Based Systems
Challenges of Safety Assurance for Industry 4.0
Concurrent Detection of Processor Control Errors by Hybrid Signature Monitoring
Dependability Evaluation of a Computing System for Traction Control of Electrical Locomotives
An Exploratory Study on Zeroconf Monitoring of Microservices Systems
Energy Efficient Configuration for QoS in Reliable Parallel Servers
Reconfiguration of Faulty Hypercubes
Towards Dependability Modeling of FT-CORBA Architectures
SUFI: A Simulation-based Fault Injection Tool for Safety Evaluation of Advanced Driver Assistance Systems Modelled in SUMO
Blockchains and Consensus Protocols: Snake Oil Warning
A Critique on the (Mis)Use of Feature-Space Attacks for Adversarial Machine Learning in NIDS
Deriving Highly Available Quorum Systems from Structural Failure Models
An Eclipse-Based Editor for SAN Templates
vepRisk - A Web Based Analysis Tool for Public Security Data
Automated Fault Tree Generation for Rust Programs
On Probabilistic Analysis of Disagreement in Synchronous Consensus Protocols
Improving the Efficiency of Multi-Cloud Storage
A K-Prototype Clustering Assisted Hybrid Heuristic Approach for Train Unit Scheduling
Dependability Evaluation of a Distributed Shared Memory Multiprocessor System
DeepHEC: Hybrid Error Coding using Deep Learning
On the Specification of Partitionable Group Membership
Fault injection acceleration using failure models on a virtualized fault-tolerant system
An ICT System to Assist Earth Fault Localization
The Logic Threshold Based Voting: A Model for Local Feedback Bridging Fault
Avoiding Malicious Byzantine Faults by a New Signature Generation Technique
Stream-based State-Machine Replication
Zero-Space In-Weight and In-Bias Protection for Floating-Point-based CNNs
Improving the Performance Predictability of Faulty Data Caches
Experimental Analysis of Binary-Level Software Fault Injection in Complex Software
Deterministic Test Vector Compression / Decompression Using an Embedded Processor
A Membership Service for a Distributed, Embedded System Based on a Time-Triggered FlexRay Network
CINNAMON: A Module for AUTOSAR Secure Onboard Communication
Refinement Patterns for Fault Tolerant Systems
Dependable Computing - EDCC 2021 Workshops - DREAMS, DSOGRI, SERENE 2021, Munich, Germany, September 13, 2021, Proceedings
Adaptive Deployment Infrastructure for Android Applications
A hierarchical method for the reduction of temporal expressions in Pandora
MAFALDA: Microkernel Assessment by Fault Injection and Design Aid
Conditional safety certificates in open systems
A Modular Architecture Template for Resource Modeling in Software-Defined Vehicles
A Practical Self-Stabilizing Leader Election for Networks of Resource-Constrained IoT Devices
A Traffic Evacuation Model for Enhancing Resilience During Railway Disruption
Testing the Input Timing Robustness of Real-Time Control Software for Autonomous Systems
Virtual Worlds for Testing Robot Navigation: A Study on the Difficulty Level
What Must the Price in Decentralized Exchanges Be?
On Single Event Upset Error Manifestation
Novel Generic Middleware Building Blocks for Dependable Modular Avionics Systems
Supports for Testing Memory Error Handling Code of In-memory Key Value Stores
Towards Linux for the Development of Mixed-Criticality Embedded Systems Based on Multi-Core Devices
Evaluating the Impact of Cross-Chain Deployment on Dapps' Market Performance in Web3 Ecosystems
AI-Generated Distributed Algorithms: Paving the Way for More Dependable Distributed Systems
Tensor-based reliability analysis of complex static fault trees