yusuke1997/dblp-id-title huggingface dataset:
Isoperimetric Inequalities and the Width Parameters of Graphs
Hedonic Games for Federated Learning with Model Sharing Data
k-Critical Graphs in P 5 -Free Graphs
Improved Algorithms for the K -Maximum Subarray Problem for Small K
Distinguishing Graphs via Cycles
A Lower Bound for the On-Line Preemptive Machine Scheduling with lp
Triangle-Free 2-Matchings Revisited
A New Field Splitting Algorithm for Intensity-Modulated Radiation Therapy
Improved Bounds for the Binary Paint Shop Problem
A Distributed Computation Offloading Scheme Based on Stackelberg Game in MEC
Structural Identifiability in Low-Rank Matrix Factorization
Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings
An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane
Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders
Bounded Degree Closest k -Tree Power Is NP-Complete
Unique Covering Problems with Geometric Sets
Graph Separators: A Parameterized View
Efficient Generation of Triconnected Plane Triangulations
Algorithms for 2-Balanced Connected k-Partition Problem in Graphs
Superconnectivity for Minimal Multi-loop Networks
Dictionary Look-Up within Small Edit Distance
Unfolding Some Classes of Orthogonal Polyhedra of Arbitrary Genus
Transformations that Preserve Maligness of Universal Distributions
Deep Specification Mining with Attention
Edge and Node Searching Problems on Trees
Sequence Alignment Algorithms for Run-Length-Encoded Strings
A Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product
Quantum Sampling for Balanced Allocations
A Survey for Conditional Diagnosability of Alternating Group Networks
Three New Algorithms for Regular Language Enumeration
Sampling Query Feedback Restricted Repairs of Functional Dependency Violations: Complexity and Algorithm
Global Optimality Conditions and Near-Perfect Optimization in Coding
On the Complexity of the Minimum Independent Set Partition Problem
Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion - A Deadlock Resolution Graph Problem
On the Reconfiguration of Chains (Extended Abstract)
Bend Minimization in Orthogonal Drawings Using Integer Programming
Turing Machines with Two-Level Memory: A Deep Look into the Input/Output Complexity
Two Generalizations of Proper Coloring: Hardness and Approximability
On the Orthogonal Drawing of Outerplanar Graphs
Fair Division with Minimal Withheld Information in Social Networks
Executing Divisible Jobs on a Network with a Fixed Number of Processors
Branch-and-Cut Algorithms for Steiner Tree Problems with Privacy Conflicts
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families
Customizable Hub Labeling: Properties and Algorithms
An Experimental Study and Comparison of Topological Peeling and Topological Walk
Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy
Ramsey Numbers for Line Graphs and Perfect Graphs
Linear Time Approximation Schemes for Geometric Maximum Coverage
Hardness and Approximation for the Star β-Hub Routing Cost Problem in $\varDelta _\beta $-Metric Graphs
On Testing for Zero Polynomials by a Set of Points with Bounded Precision
A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs
Fault-Hamiltonicity of Product Graph of Path and Cycle
Metric 1-Median Selection: Query Complexity vs. Approximation Ratio
Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith's Methods
Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments
Hitting Geometric Objects Online via Points in $\mathbb {Z}^d$
Classifying the Clique-Width of H-Free Bipartite Graphs
Quasi-bicliques: Complexity and Binding Pairs
On the Hardness against Constant-Depth Linear-Size Circuits
Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs
An On-Line Algorithm for Some Uniform Processor Scheduling
Sublinear-Space Approximation Algorithms for Max r-SAT
Redefining Entity Integration: Theoretical Insights for GNN-Based Recommender Systems
The On-Line Heilbronn's Triangle Problem in Three and Four Dimensions
On the Performances of Nash Equilibria in Isolation Games
On the Complexity of 2-Club Cluster Editing with Vertex Splitting
The Maximum Disjoint Routing Problem
Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing
Multiplicative Adaptive Algorithms for User Preference Retrieval
Optimal Online Algorithms on Two Hierarchical Machines with Resource Augmentation
On the Number of Minimum Cuts in a Graph
Solving Constraint Satisfaction Problems with DNA Computing
A Logical Framework for Knowledge Sharing in Multi-agent Systems
$(\min ,+)$ Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences
The Performance of Neighbor-Joining Algorithms of Phylogeny Recronstruction
Optimal Framework for Clustering with Noisy Queries
An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems
Improved Algorithms for Chemical Threshold Testing Problems
Edge-Intersection Graphs of k -Bend Paths in Grids
Three Systems for Shared Generation of Authenticators
Gene Network: Model, Dynamics and Simulation
Straight Skeletons for General Polygonal Figures in the Plane
Unexplored Steiner Ratios in Geometric Networks
Distance Constrained Vehicle Routing Problem to Minimize the Total Cost
A New Class of Symbolic Abstract Neural Nets: Tissue P Systems
Small Weight Bases for Hamming Codes
Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits
Simple O(n~log^2~n) Algorithms for the Planar 2-Center Problem
How to Schedule the Marketing of Products with Negative Externalities
Fast Algorithms for Aligning Sequences with Restricted Affine Gap Penalties
Can a Graph Have Distinct Regular Partitions?
Approximation Algorithms for the Connected Sensor Cover Problem
APTER: Aggregated Prognosis Through Exponential Re-weighting
On-Line Variable Sized Covering
A Proof System for a Unified Temporal Logic
Computational Complexity Classification of Partition under Compaction and Retraction
Binary Enumerability of Real Numbers
Unions of Disjoint NP-Complete Sets
Profit Maximization for Competitive Influence Spread in Social Networks
Computing Optimal Embeddings for Planar Graphs
Topological Vulnerability-Based Imperceptible Node Injection Attack Against Dynamic Graph Neural Network
VOABE: An Efficient Verifiable Outsourced Attribute-Based Encryption for Healthcare Systems
Packing Cubes into a Cube in (D>3)-Dimensions
One-Way Probabilistic Reversible and Quantum One-Counter Automata
Revisiting Maximum Satisfiability and Related Problems in Data Streams
Optimal Algorithms for Running Max and Min Filters on Random Inputs
On Higher Arthur-Merlin Classes
Sparse Parity-Check Matrices over Finite Fields (Extended Abstract)
All-to-All Broadcast in Dragonfly Networks
Efficient Partitioning Algorithms for Optimizing Big Graph Computation
Single-vehicle Scheduling Problem on a Straight Line with Time Window Constraints
Geodesic Fault-Tolerant Additive Weighted Spanners
On-Line Grid-Packing with a Single Active Grid
Polyhedral Aspects of the Consecutive Ones Problem
Simple Distributed Algorithms for Approximating Minimum Steiner Trees
On Covering and Rank Problems for Boolean Matrices and Their Applications
An Approach to Agent Path Planning Under Temporal Logic Constraints
Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data
A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications
Hitting and Piercing Rectangles Induced by a Point Set
Almost Optimum ℓ-Covering of $\mathbb {Z}_n$
On log-Time Alternating Turing Machines of Alternation Depth k (Extended Abstract)
The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
Enumerating Non-crossing Minimally Rigid Frameworks
Polychromatic Colorings of n-Dimensional Guillotine-Partitions
Minimizing the Cost of Batch Calibrations
The Multi-Weighted Spanning Tree Problem (Extended Abstract)
Online Algorithms for Batch Machines Scheduling with Delivery Times
The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model
Improved Lower Bounds for the Randomized Boppana-Halldórsson Algorithm for MAXCLIQUE
Enhanced Sequence Reconstruction with DNA Microarray Application
An Algorithm for Heilbronn's Problem
Similarity in Two-Dimensional Strings
Constant Approximation for Stochastic Orienteering Problem with (1+ε)-Budget Relaxiation
The Path Set Packing Problem
Approximating High-Dimensional Range Queries with kNN Indexing Techniques
Mining Preserving Structures in a Graph Sequence
Single Machine Lot Scheduling to Minimize Maximum Weighted Completion Time
Information Distance from a Question to an Answer
Improved Approximation Algorithms for Combinatorial Contracts with Type Constraints
Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract)
Quadratic Kernelization for Convex Recoloring of Trees
Extensions of the Minimum Cost Homomorphism Problem
On the Hardness of Opinion Dynamics Optimization with L 1 -Budget on Varying Susceptibility to Persuasion
Lower Bounds for Small Ramsey Numbers on Hypergraphs
"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
Pure Nash Equilibria in Restricted Budget Games
Imbalance Parameterized by Twin Cover Revisited
Algorithm for the Cost Edge-Coloring of Trees
The Conditional Location of a Median Path
Bin Packing and Covering Problems with Rejection
Some Notes on the Nearest Neighbour Interchange Distance
Multi-Load Agent Path Finding for Online Pickup and Delivery Problem
Parameterized Shifted Combinatorial Optimization
On Extensions of Min-k-Union$^\star $
Entropy of Weight Distributions of Small-Bias Spaces and Pseudobinomiality
An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks
The Inverse Satisfiability Problem
Effects of Inoculation Based on Structural Centrality on Rumor Dynamics in Social Networks
A Quadratic Vertex Kernel for Diamond-Free Edge Deletion
Changing the Diameter of Graph Products
New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation
An Improved Bregman k-means++ Algorithm via Local Search
On Parameterized Independent Feedback Vertex Set
HR-Tree: A Hybrid PMem-DRAM and Write-Optimized R-Tree for Spatial Data Storage
Some New Results on Gallai Theorem and Perfect Matching for k-Uniform Hypergraphs
A Better Subgraph of the Minimum Weight Triangulation
Manipulation Strategies for the Rank-Maximal Matching Problem
Quantifying Communication in Synchronized Languages
Simultaneous All-Pay Auctions with Budget Constraints
Efficient Non-interactive Range Proof
Probabilities to Accept Languages by Quantum Finite Automata
Efficient Testing of Forecasts
Matching and Comparing Sequences in Molecular Biology (Abstract)
On the Density of Regular and Context-Free Languages
The Secretary Problem with Reservation Costs
Algorithmic Aspect of Minus Domination on Small-Degree Graphs
Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems
A Remark on One-Wayness versus Pseudorandomness
Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers
Approximating the λ-low-density Value
PC-Trees vs. PQ-Trees
On the Complexity of Approximating Colored-Graph Problems
Clairvoyant Mechanisms for Online Auctions
Multi-coloring Trees
A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays
Pairwise Data Clustering and Applications
Heuristic Algorithms for the Min-Max Edge 2-Coloring Problem
Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies
More Routes for Evacuation
On Sorting Permutations by Double-Cut-and-Joins
Genome Rearrangements with Partially Ordered Chromosomes
On the 100% Rule of Sensivity Analzsis in Linear Programming
Energy-Efficient Size Approximation of Radio Networks with No Collision Detection
Dynamic Storage Allocation and On-Line Colouring Interval Graphs
Determination of Glycan Structure from Tandem Mass Spectra
A Local Search Approximation Algorithm for the k-means Problem with Penalties
Binary Jumbled Pattern Matching: Suffix Tree Indexing
Optimal Insertion of a Segment Highway in a City Metric
Realization Problems on Reachability Sequences
On the Complexity of Minimum Maximal Acyclic Matchings
Optimizing Fresh Warehouse Networks Using MIP and SARIMA Forecasting
Exploration of K12 Multi Level Information and AI Talent Training Model
Interference in Cellular Networks: The Minimum Membership Set Cover Problem
Dimension, Halfspaces, and the Density of Hard Sets
Online One-Sided Smooth Function Maximization
On the Complexity of k-Metric Antidimension Problem and the Size of k-Antiresolving Sets in Random Graphs
Longest Double-Bounded (k]-Tuple Common Substrings
Bin Packing Game with an Interest Matrix
On Indecomposability Preserving Elimination Sequences
The Least-Core and Nucleolus of Path Cooperative Games
Stable Matchings in Trees
The Communication Complexity of Distributed Maximization
A Cominatorial Approach to Performance Analysis of a Shared-Memory Multiprocessor
Minimizing Maximum Lateness on Identical Parallel Batch Processing Machines
Approaching Optimal Duplicate Detection in a Sliding Window
Lower Bounds for the Size of Nondeterministic Circuits
On Packing and Coloring Hyperedges in a Cycle
Coresets for k-Median of Lines with Group Fairness Constraints
Approximation Algorithms for Capacitated Assignment with Budget Constraints and Applications in Transportation Systems
Constructing a Strongly Convex Superhull of Points
How to Catch L 2 -Heavy-Hitters on Sliding Windows
Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs
On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees
Displacing Random Sensors to Avoid Interference
Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling
Algorithms for Point Set Matching with k-Differences
Extending the Accommodating Function
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph
Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection
Space Efficient Multi-dimensional Range Reporting
NP-completeness Results for Partitioning a Graph into Total Dominating Sets
Online Non-monotone DR-Submodular Maximization: 1/4 Approximation Ratio and Sublinear Regret
Exact Learning of Subclasses of CDNF Formulas with Membership Queries
A Three-String Approach to the Closest String Problem
Target Influence Maximization Against Overexposure Under Threshold-Dependent Model in Online Social Networks
A Dynamic Working Set Method for Compressed Sensing
Optimal Offline Extraction of Irredundant Motif Bases
Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings
A Cost-Sharing Scheme for the k-Product Facility Location Game with Penalties
Linear Algorithm for Broadcasting in Unicyclic Graphs
The Complexity of Black-Box Ring Problems
Hierarchical Topological Inference on Planar Disc Maps
On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs
Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract)
Sensitivity, Affine Transforms and Quantum Communication Complexity
Randomized Incremental Construction for the Hausdorff Voronoi Diagram Revisited and Extended
L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains
Computing and Combinatorics - 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings
Boxicity and Poset Dimension
On the Complete Width and Edge Clique Cover Problems
A Broadcasting Algorithm on the Arrangement Graph
On the Number of Cycles in Planar Graphs
On the Expected Time for Herman's Probabilistic Self-stabilizing Algorithm
The Heterogeneous Rooted Tree Cover Problem
Large k-Gons in a 1.5D Terrain
A 4-Space Bounded Approximation Algorithm for Online Bin Packing Problem
Sparse Suffix Trees
The Cover Time of Deterministic Random Walks
Mechanism Design for Facility Location with Fractional Preferences and Minimum Distance
Cabbage Can't Always Be Transformed into Turnip: Decision Algorithms for Sorting by Symmetric Reversals
Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties
Lower Bounds for Wide-Sense Non-blocking Clos Network
Counting Paths in VPA Is Complete for #NC 1
On Physical Mapping Algorithms - An Error-Tolerant Test for the Consecutive Ones Property
Some New Results on Inverse Sorting Problems
Generalized Graph k-Coloring Games
Connected Coloring Completion for General Graphs: Algorithms and Complexity
Lower Bounds for Special Cases of Syntactic Multilinear ABPs
An O(2 O(k) n 3 ) FPT Algorithm for the Undirected Feedback Vertex Set Problem
A Linear Edge Kernel for Two-Layer Crossing Minimization
On the Computation of 3D Visibility Skeletons
New Teaching Philosophy of Theoretical Computer Science Courses in AI Era Data Structure as an Example
One-Dimensional k-Center on Uncertain Data
Graph Coloring and the Immersion Order
On the Enumeration of Minimal Non-pairwise Compatibility Graphs
Generating Minimal k-Vertex Connected Spanning Subgraphs
Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings
An Upper Bound on the Number of Rectangulations of a Point Set
The Discrete Voronoi Game in a Simple Polygon
Priority Algorithms for the Subset-Sum Problem
Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform Degrees
Covering a Set of Points with a Minimum Number of Turns
Separating NE from Some Nonuniform Nondeterministic Complexity Classes
On the Most Imbalanced Orientation of a Graph
Outerplanar Graph Drawings with Few Slopes
O(n 2 log n) Time On-Line Construction of Two-Dimensional Suffix Trees
Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility
On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
On the Complexity of Commutativity Analysis
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices
Computational Complexity of Synchronization Under Regular Commutative Constraints
A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application
Linear Time Algorithms for the Basis of Abelian Groups
On the Number of Anchored Rectangle Packings for a Planar Point Set
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
Improved On-Line Broadcast Scheduling with Deadlines
Rectangulating Rectilinear Polygons in Parallel
The Complexity of Boolean Matrix Root Computation
Better Bounds on the Accommodating Ratio for the Seat Reservation Problem
A Card-Minimal Three-Input AND Protocol Using Two Shuffles
Diagnosability of Two-Matching Composition Networks
Distributed Weighted Vertex Cover via Maximal Matchings
Dominating Set Counting in Graph Classes
New Lower Bound and Algorithm for Online Geometric Hitting Set Problem
On the Oscillations in Cournot Games with Best Response Strategies
Speedy Colorful Subtrees
Bounded Model Checking for Propositional Projection Temporal Logic
Algorithms for Full-View Coverage of Targets with Group Set Cover
The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs
Matroid Representation of Clique Complexes
Square-Orthogonal Drawing with Few Bends per Edge
Graph Classes and Approximability of the Happy Set Problem
Finding Theorems in NBG Set Theory by Automated Forward Deduction Based on Strong Relevant Logic
A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm
Finding Patterns with Variable Length Gaps or Don't Cares
Approximation Algorithm for the Balanced 2-Connected Bipartition Problem
Optimal Online Two-Way Trading with Bounded Number of Transactions
Computing the Girth of a Planar Graph in Linear Time
Popular Matchings: Structure and Algorithms
Radio Networks with Reliable Communication
A Faster FPTAS for the Subset-Sums Ratio Problem
A TOF Estimation Method Based on the Improved MUSIC Algorithm
On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules
Approximating the Rainbow - Better Lower and Upper Bounds
Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable
Algorithmic Approaches to Information Retrieval and Data Mining (Abstract)
An Approach to Tight I/O Lower Bounds for Algorithms with Composite Procedures
Online Coloring of Bipartite Graphs with and without Advice
Characterizing Star-PCGs
On the Modulo Degree Complexity of Boolean Functions
From Metric to General Graphs: FPT Constant-Factor Approximation Algorithms for Three Location Problems
Enumerating Floorplans with Any Set of Columns
An Erdős-Pósa Theorem on Neighborhoods and Domination Number
Minimum Dominating Sets of Intervals on Lines (Extended Abstract)
A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter
Towards Constructing Optimal Strip Move Sequences
Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms
Strong Solutions to the Identification Problem
Genomic Distances under Deletions and Insertions
Algorithms for Hard-Constraint Point Processes via Discretization
On S-Regular Prefix-Rewriting Systems and Automatic Structures
A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem
Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings
On 1-Factorizations of Bipartite Kneser Graphs
Improved Approximation Algorithms for a Bilevel Knapsack Problem
Broadcasting in Generalized de Bruijn Digraphs
Plane Graphs with Acyclic Complex
Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data
Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings
A Fast Sorting Algorithm and Its Generalization on Broadcast Communications
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs
The Topology Aware File Distribution Problem
On the Representations of NC and Log-Space Real Numbers
Conservative Algorithms for Parallel and Sequential Integer Sorting
Neighborhood-Based Dynamic Community Detection with Graph Transform for 0-1 Observed Networks
Maximum Red/Blue Interval Matching with Applications
Efficient Mappings for Parity-Declustered Data Layouts
Optimally Solving a Transportation Problem Using Voronoi Diagrams
Quantum Query Complexity of Unitary Operator Discrimination
The Money Changing Problem Revisited: Computing the Frobenius Number in Time O(k a 1 )
(6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs
Approximating Weighted Duo-Preservation in Comparative Genomics
Toroidal Grids Are Anti-magic
From Preemptive to Non-preemptive Speed-Scaling Scheduling
Efficient Algorithms for Intensity Map Splitting Problems in Radiation Therapy
An Approximation Algorithm for Sorting by Bounded Singleton Moves
Conditional Fractional Matching Preclusion for Burnt Pancake Graphs and Pancake-Like Graphs (Extended Abstract)
Complete Problems for Valiant's Class of qp-Computable Families of Polynomials
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins
How to Swap a Failing Edge of a Single Source Shortest Paths Tree
Petri Nets with Simple Circuits
Adaptive Weighting-Based Local Search for Route Number Minimization for Vehicle Routing Problem with Time Windows
A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method
Finding Many Optimal Paths Without Growing Any Optimal Path Trees
Reallocation Problems with Minimum Completion Time
On the Power of Input-Synchronized Alternating Finite Automata
The Traveling Salesman Problem with Few Inner Points
Compressed Directed Acyclic Word Graph with Application in Local Alignment