yusuke1997/dblp-id-title huggingface dataset:
An Online Algorithm for a Problem in Scheduling with Set-ups and Release Times
Average-Case Analysis of Approximate Trie Search
Approximation and Tidying - A Problem Kernel for s-Plex Cluster Vertex Deletion
Parallel Computation of High-Dimensional Robust Correlation and Covariance Matrices
Almost-Smooth Histograms and Sliding-Window Graph Algorithms
Minimum Weakly Fundamental Cycle Bases Are Hard To Find
Multistage s-t Path: Confronting Similarity with Dissimilarity
Evaluating Network Reliability and 2-Edge-Connected Reliability in Linear Time for Bounded Pathwidth Graphs
A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP
An Approximation Algorithm for Circular Arc Colouring
The Price of Selfish Routing
A Paradigm for Listing (s, t)-Cuts in Graphs
Sorting Helps for Voronoi Diagrams
Squares, Cubes, and Time-Space Efficient String Searching
Stability in the Self-Organized Evolution of Networks
Fractional Cascading: II. Applications
Design and Implementation of a Practical Parallel Delaunay Algorithm
Special Issue on New Theoretical Challenges in Machine Learning
Observability of Lattice Graphs
Heuristic Sampling on DAGs
A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners
Improved Approximation Algorithms for the Average-Case Tree Searching Problem
The Data Broadcast Problem with Non-Uniform Transmission Times
Exact and Approximation Algorithms for Clustering
Lines in Space: Combinatorics and Algorithms
Discounted Reward TSP
Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems
Sorting Networks of Logarithmic Depth, Further Simplified
On the Parallel-Decomposability of Geometric Problems
Dictionary Matching with a Bounded Gap in Pattern or in Text
An O(n³) Recognition Algorithm for Bithreshold Graphs
Planar Polyline Drawings via Graph Transformations
Mim-Width II. The Feedback Vertex Set Problem
Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts
Guest Editor's Foreword: Special Issue on On-Line Algorithms
On the Complexity of Colouring Antiprismatic Graphs
Area-Time Lower-Bound Techniques with Applications to Sorting
Structural Lines, TINs, and DEMs
A Conjecture on Wiener Indices in Combinatorial Chemistry
Injective Colorings of Graphs with Low Average Degree
An Efficient Algorithm for Batch Stability Testing
Data Transfers in Networks
On-Line Competitive Algorithms for Call Admission in Optical Networks
Finding Geometric Facilities with Location Privacy
Faster algorithms for counting subgraphs in sparse graphs
Nonholonomic Multibody Mobile Robots: Controllability and Motion Planning in the Presence of Obstacles
Competitive Optimal On-Line Leasing
An Extension of Karmarkar's Algorithm for Linear Programming Using Dual Variables
Twin-width and Polynomial Kernels
Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part I: Stemless TAP
Level-Based Analysis of the Univariate Marginal Distribution Algorithm
A Simple Ant Colony Optimizer for Stochastic Shortest Path Problems
Guest Editorial for "Group Testing: models and applications"
O(log log n)-Time Integer Geometry on the CRCW PRAM
Editor's Note: Special Issue on Parameterized and Exact Computation
A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains
On Partial Updating in a Potential Reduction Linear Programming Algorithm of Kojima, Mizuno, and Yoshise
Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design
Polynomial-time Combinatorial Algorithm for General Max-Min Fair Allocation
Cheating Strategies for the Gale-Shapley Algorithm with Complete Preference Lists
Improved Parameterized Set Splitting Algorithms: A Probabilistic Approach
Visibility of Disjoint Polygons
New Bounds for Multidimensional Packing
Special Issue on Algorithms and Data Structures (WADS 2019)
New Approximation Bounds for Lpt Scheduling
Parameterization in Finite Precision
A New Vertex Coloring Heuristic and Corresponding Chromatic Number
A 2n-2 Step Algorithm for Routing in an n*n Array with Constant-Size Queues
One for the Price of Two: a Unified Approach for Approximating Covering Problems
Optimizing Area for Three-Layer Knock-Knee Channel Routing
Editorial: ISAAC 2008 Special Issue
Fast Parallel Reordering and Isomorphism Testing of k-Trees
An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face
Theory of Randomized Search Heuristics
A Risk-Reward Framework for the Competitive Analysis of Financial Games
Analyses of Cardinal Auctions
Network Flow and 2-Satisfiability
Online File Caching with Rejection Penalties
Stochastic Dominance and the Bijective Ratio of Online Algorithms
Simple Algorithms for the On-Line Multidimensional Dictionary and Related Problems
Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window
Expand the Shares Together: Envy-Free Mechanisms with a Small Number of Cuts
Correction: On the Parameterized Complexity of Controlling Amendment and Successive Winners
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals
b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs
Parameterized Measure & Conquer for Problems with No Small Kernels
A Closer Look at Multiple Forking: Leveraging (In)Dependence for a Tighter Bound
FPTAS for Minimizing the Earth Mover's Distance Under Rigid Transformations and Related Problems
Path-Planning Strategies for a Point Mobile Automaton Moving Amidst Unknown Obstacles of Arbitrary Shape
Building Large Phylogenetic Trees on Coarse-Grained Parallel Machines
Maximizing Coverage While Ensuring Fairness: A Tale of Conflicting Objectives
A Linear-Time Algorithm for the Generation of Trees
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs
Approximating Points by a Piecewise Linear Function
Guest Editorial: Selected Papers from WG 2014
Local Search Algorithms for the Maximum Carpool Matching Problem
Minimal Fixturing of Frictionless Assemblies: Complexity and Algorithms
Efficient Algorithms for Clique-Colouring and Biclique-Colouring Unichord-Free Graphs
Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times
Lempel-Ziv Index for q -Grams
R-Kleene: A High-Performance Divide-and-Conquer Algorithm for the All-Pair Shortest Path for Densely Connected Networks
Deterministic Constructions of High-Dimensional Sets with Small Dispersion
Trade-offs Between the Size of Advice and Broadcasting Time in Trees
Duality of Constrained Voronoi Diagrams and Delaunay Triangulations
Broadcasting in Heterogeneous Networks
Scheduling Partially Ordered Jobs Faster than 2 n
Approximating Tree Edit Distance through String Edit Distance
Improved Algorithms for Maximum Agreement and Compatible Supertrees
A Unified Model and Algorithms for Temporal Map Labeling
On Multiple Moving Objects
A Distributed Algorithm for Computing the Node Search Number in Trees
Greedy Oriented Flows
Asymptotics of the Moments of Extreme-Value Related Distribution Functions
On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs
An Opportunistic Global Path Planner
Tight Bounds for Active Self-Assembly Using an Insertion Primitive
An Addendum to Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons
Balancing Minimum Spanning Trees and Shortest-Path Trees
String Matching in Lempel-Ziv Compressed Strings
Fast Dynamic Transitive Closure with Lookahead
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers
Space Efficient Dynamic Orthogonal Range Reporting
The Buffer Tree: A Technique for Designing Batched External Data Structures
Local Embeddings of Metric Spaces
Motion Planning with Inertial Constraints
Algorithms to Separate {0, \frac12}\{0, \frac{1}{2}\} -Chvátal-Gomory Cuts
How to Sort by Walking and Swapping on Paths and Trees
Log-Diameter MST Verification and Sensitivity in MPC
Special Issue on Computing and Combinatorics
U -Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited
Quantum Walks Can Find a Marked Element on Any Graph
An O(n log n) Time Algorithm for Computing the Path-Length Distance Between Trees
Near-Optimal Bounded-Degree Spanning Trees
Computing Diameter in the Streaming and Sliding-Window Models
Correction to: Guess Free Maximization of Submodular and Linear Sums
A Primal-Dual Algorithm for the Computation of Market Equilibrium with Logarithmic Utility Functions
Optimal Multilayer Channel Routing with Overlap
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data
On the Planar Piecewise Quadratic 1-Center Problem
The Runtime of the Compact Genetic Algorithm on Jump Functions
A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees
Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors
A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints
Guest Editors' Forward
Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time
Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs
Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems
Blocking Trails for f-factors of Multigraphs
Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms
Log-Linear Convergence and Divergence of the Scale-Invariant (1+1)-ES in Noisy Environments
Strip Planarity Testing for Embedded Planar Graphs
Quasi-Fully Dynamic Algorithms for Two-Connectivity and Cycle Equivalence
A Unified Approach to Linear Probing Hashing with Buckets
On Approximating the Longest Path in a Graph
Nonpreemptive Scheduling of Periodic Tasks in Uni- and Multiprocessor Systems
Floorplan Design of VLSI Circuits
Top-k Term-Proximity in Succinct Space
The Complexity of Oblivious Plans for Orienting and Distinguishing Polygonal Parts
Provably Good Approximation Algorithms for Optimal Kinodynamic Planning: Robots with Decoupled Dynamics Bounds
Efficient Fully-Compressed Sequence Representations
Enumeration of Support-Closed Subsets in Confluent Systems
A Multiplicative Barrier Function Method for Linear Programming
Runtime Analysis for Self-adaptive Mutation Rates
The Complexity of Hashing with Lazy Deletion
Covering with Ellipses
A Polynomial-Time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs
Maximizing the Total Profit of Rectangles Packed into a Rectangle
Rectilinear Steiner Tree Heuristics and Minimum Spanning Tree Algorithms Using Geographic Nearest Neighbors
Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints
Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement
All-to-All Optical Routing in Chordal Rings of Degree 4
Optimal Search and One-Way Trading Online Algorithms
Randomized Algorithms for Low-Rank Matrix Factorizations: Sharp Performance Bounds
An Efficient Algorithm for One-Step Planar Compliant Motion Planning with Uncertainty
An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon
A Fast Algorithm for the Generalized Parametric Minimum Cut Problem and Applications
The Complexity of Optimization on Grids
Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs
Equivalence of epsilon-Approximate Separation and Optimization in Fixed Dimensions
Approximate Well-supported Nash Equilibria Below Two-thirds
Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks
Greedy Matching: Guarantees and Limitations
Outer 1-Planar Graphs
A 'Stochastic Safety Radius' for Distance-Based Tree Reconstruction
On the Planarization of Wireless Sensor Networks
Book Embeddability of Series-Parallel Digraphs
Special Issue: Algorithmic Tools in Cryptography
Augmenting the Connectivity of Outerplanar Graphs
A Note on the Asymptotic Behavior of the Depth of Tries
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part I
Localized Techniques for Broadcasting in Wireless Sensor Networks
Refinements to Nearest-Neighbor Searching in k-Dimensional Trees
Self-Bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications
Local Geometric Spanners
Guest Editorial: Special Issue on Algorithms and Computation
Multiple Translational Containment. Part II: Exact Algorithms
A Linear-Time Algorithm for the Perfect Phylogeny Haplotype Problem
Analysis of Surrogate-Assisted Information-Geometric Optimization Algorithms
Characterizing Proximity Trees
Lower Bounds Against Weakly-Uniform Threshold Circuits
Pattern Masking for Dictionary Matching: Theory and Practice
Improved Algorithms for Constructing Fault-Tolerant Spanners
Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs
Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy
On a Traveling Salesman Problem for Points in the Unit Cube
Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs
Approximating Min Sum Set Cover
An Approximation Algorithm for the Minimum Co-Path Set Problem
A Linear Algorithm for the All-Bidirectional-Edges Problem on Planar Graphs
Order-k Voronoi Diagrams of Sites with Additive Weights in the Plane
Crossing Number for Graphs with Bounded Pathwidth
Tree Automata and Pigeonhole Classes of Matroids: I
Editor's Foreword: Special Issue on Computational Geometry
Dynamic TCP Acknowledgment and Other Stories about e/(e-1)
Optimal Tracking of Distributed Heavy Hitters and Quantiles
Preface: Special Issue on WADS 2017
The Performance of Neighbor-Joining Methods of Phylogenetic Reconstruction
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
Approximation Guarantee of OSP Mechanisms: The Case of Machine Scheduling and Facility Location
Rectangle Transformation Problem
Special Issue on Analysis of Algorithms
A General Class of Heuristics for Minimum Weight Perfect Matching and Fast Special Cases with Doubly and Triply Logarithmic Errors
Limitations of Incremental Dynamic Programming
Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem
Mind the Gap! - Online Dictionary Matching with One Gap
Parameterized Algorithms for Finding Square Roots
The A Priori Traveling Repairman Problem
Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs
Non-Cooperative Tree Creation
The Consecutive Ones Submatrix Problem for Sparse Matrices
Fast Algorithms for Computing the Smallest k-Enclosing Circle
Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times
A Faster and More Space-Efficient Algorithm for Inferring Arc-Annotations of RNA Sequences through Alignment
Independent Set of Convex Polygons: From $$n^{\epsilon }$$ n ϵ to $$1+\epsilon $$ 1 + ϵ via Shrinking
Approximately Uniform Online Checkpointing with Bounded Memory
Online Minimization of the Maximum Starting Time: Migration Helps
Envy-Free Matchings with Lower Quotas
Maximum Matching in Regular and Almost Regular Graphs
Schedulers for Larger Classes of Pinwheel Instances
Approximation Algorithms for the Two-Watchman Route in a Simple Polygon
Enumerating k-Arc-Connected Orientations
Dynamic Algorithms for Multimachine Interval Scheduling Through Analysis of Idle Intervals
A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes
Classification Accuracy Based on Observed Margin
A Lower Bound for Scheduling Mechanisms
Time-Optimal Trajectories of a Rod in the Plane Subject to Velocity Constraints
A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort
A Unified Presentation of Some Urn Models
Two Problems in Max-Size Popular Matchings
Optimality in External Memory Hashing
Unified Compression-Based Acceleration of Edit-Distance Computation
DNA Physical Mapping and Alternating Eulerian Cycles in Colored Graphs
Approximation Algorithms for Treewidth
The Price of Anarchy in Bilateral Network Formation in an Adversary Model
The Generalized Definitions of the Two-Dimensional Largest Common Substructure Problems
Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications
Convex Hulls of Objects Bounded by Algebraic Curves
k-Approximate Quasiperiodicity Under Hamming and Edit Distance
The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots
Minimum Hitting Set of Interval Bundles Problem: Computational Complexity and Approximability
Scheduling Multihop CDMA Networks in the Presence of Secondary Conflicts
On Triangulating Planar Graphs Under the Four-Connectivity Constraint
Runtime Analyses of the Population-Based Univariate Estimation of Distribution Algorithms on LeadingOnes
Minimizing Mean Completion Time in a Batch Processing System
Cost Sharing Mechanisms for Fair Pricing of Resource Usage
Optimal VLSI Graph Embeddings in Variable Aspect Ratio Rectangles
Recognizing Optimal 1-Planar Graphs in Linear Time
Algorithms for Graphs Embeddable with Few Crossings per Edge
Preface-S.I.: LATIN 2014
Three Rules Suffice for Good Label Placement
Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-Compaction
Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part II
Maintaining Regular Properties Dynamically in k -Terminal Graphs
Local Search Algorithms for the Red-Blue Median Problem
Construction Sequences and Certifying 3-connectivity
Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs
Distinct Fringe Subtrees in Random Trees
Staircase Visibility and Computation of Kernels
On the Analysis of Stochastic Divide and Conquer Algorithms
Linking Classical and Quantum Key Agreement: Is There a Classical Analog to Bound Entanglement?
Average Case Analysis of Moore's State Minimization Algorithm
An Algorithm for Simultaneous Backbone Threading and Side-Chain Packing
Foreword: Special Issue on Parameterized and Exact Computation
On the Parameterized Complexity of Controlling Amendment and Successive Winners
Evaluation of Monotone DNF Formulas
Shortest Paths in Time-Dependent FIFO Networks
Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines
A New Scaling Algorithm for the Maximum Mean Cut Problem
Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal
Correction to: A Connection Between Sports and Matroids: How Many Teams Can We Beat?
A Note on Point Location in Delaunay Triangulations of Random Points
Can PAC Learning Algorithms Tolerate Random Attribute Noise?
Scalable Parallel Algorithms for FPT Problems
A (2- c (1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem
Dynamic Programming on the Word RAM
Foreword from the Guest Editors
Bounded-Hop Communication Networks
Reconstructing the Topology of a CAD Model - a Discrete Approach
Parallel Computation of Disease Transforms
Saddle Points in Random Matrices: Analysis of Knuth Search Algorithms
Compressed Dynamic Range Majority and Minority Data Structures
Minimizing Channel Density in Standard Cell Layout
Speed Scaling on Parallel Processors
Compact Routing on Chordal Rings of Degree 4
On Scheduling Mechanisms Beyond the Worst Case
(Incremental) Priority Algorithms
Editorial: Special Issue on Computing and Combinatorics
Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling
Mechanisms for (Mis)allocating Scientific Credit
Online Geometric Covering and Piercing
Grundy Coloring and Friends, Half-Graphs, Bicliques
Internal and External Algorithms for the Points-in-Regions Problem-the INSIDE Join of Geo-Relational Algebra
Extending Greedy Multicast Routing to Delay Sensitive Applications
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules
Strong Articulation Points and Strong Bridges in Large Scale Graphs
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
On Structural Parameterizations of the Harmless Set Problem
Counting or Producing All Fixed Cardinality Transversals
Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021)
Scalable Zero Knowledge Via Cycles of Elliptic Curves
Why Neighbor-Joining Works
Immunization in the Threshold Model: A Parameterized Complexity Study
Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)
Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses
An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem
Track Layouts, Layered Path Decompositions, and Leveled Planarity
Bounding the Inefficiency of Length-Restricted Prefix Codes
There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Sorting in Constant Number of Row and Column Phases on a Mesh
Blowing Bubbles for Multi-Scale Analysis and Decomposition of Triangle Meshes
Average Case Analysis of Gosper's Algorithm for a Class of Urn Model Inputs
A Class of Asymptotically Stable Algorithms for Learning-Rate Adaptation
A Limit Law for Outputs in Random Recursive Circuits
Fast Algorithms for max independent set
Symbolic Graphs: Linear Solutions to Connectivity Related Problems
Capacitated Domination: Problem Complexity and Approximation Algorithms
A Linear Algorithm To Decompose Inheritance Graphs Into Modules
Computing the Cover Array in Linear Time
Stochastic Neural Networks
Algorithms for the Unit-Cost Stochastic Score Classification Problem
Computing the Throughput of Probabilistic and Replicated Streaming Applications
A Class of Algorithms for Collision Resolution with Multiplicity Estimation
Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity
Hybridizing Evolutionary Algorithms with Variable-Depth Search to Overcome Local Optima
Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments
Collecting Weighted Items from a Dynamic Queue
Fast Generation of Random Permutations Via Networks Simulation
Space-Efficient Vertex Separators for Treewidth
On Constructing Minimum Spanning Trees in R k l
A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph
Model-Based Segmentation and Classification of Trajectories
Optimal Piecewise Linear Motion of an Object Among Obstacles
Computing Vision Points in Polygons
A Faster Exact-Counting Protocol for Anonymous Dynamic Networks
Bottom-Up Mergesort - a Detailed Analysis
On the Fastest Vickrey Algorithm
Complexity of Finding Graph Roots with Girth Conditions
Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems
Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut
Deterministic Compression with Uncertain Priors
Optimization Problems Related to Zigzag Pocket Machining
Fixed Block Compression Boosting in FM-Indexes: Theory and Practice
A Projective Method for Linear Programming with Box-Type Constraints
The Number of Tree Stars Is O * (1.357 k )
Steiner Minimal Trees for a Class of Zigzag Lines
Guest Editor's Foreword: Special Issue on Computational Molecular Biology
Cache-Oblivious Hashing
An NC Algorithm for Finding a Minimum Weighted Completion Time Schedule on Series Parallel Graphs
Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs
Maximal Selection in Tandem Networks with Symmetric Hearing Range
Mobile Robot Self-Localization without Explicit Landmarks
Strategy Under the Unknown Stochastic Environment: The Nonparametric Lob-Pass Problem
Obtaining Matrices with the Consecutive Ones Property by Row Deletions
Unique Response Roman Domination: Complexity and Algorithms
Detecting Holes and Antiholes in Graphs
Free-Form Pose Estimation by Using Twist Representations
Admission Control in Networks with Advance Reservations
Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size