yusuke1997/dblp-id-title huggingface dataset:
Further results on 2-distance coloring of graphs
Top-k overlapping densest subgraphs: approximation algorithms and computational complexity
Near automorphisms of trees with small total relative displacements
Online algorithms for the maximum k-interval coverage problem
Compact labelings for efficient first-order model-checking
A note on (s, t)-relaxed L(2, 1)-labeling of graphs
Online bottleneck matching
Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks
On computing a minimum secure dominating set in block graphs
Parity and strong parity edge-colorings of graphs
Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines
On the sequential price of anarchy of isolation games
Sortabilities of Partition Properties
L(p, q)-labeling of sparse graphs
Maximizing misinformation restriction within time and budget constraints
Computation and algorithm for the minimum k-edge-connectivity of graphs
Algorithmic aspects of 2-secure domination in graphs
An online joint replenishment problem combined with single machine scheduling
Due date assignment and two-agent scheduling under multitasking environment
On the hardness of learning queries from tree structured data
Unfolding H-convex Manhattan Towers
Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve
Non-adaptive group testing on graphs with connectivity
On weak Pareto optimality of nonatomic routing networks
Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems
Advancing discrete optimization: novel approaches with dataless neural networks
On Integrality, Stability and Composition of Dicycle Packings and Covers
Note on the hardness of generalized connectivity
Improved algorithms for the evacuation route planning problem
Lexicographically minimizing axial motions for the Euclidean TSP
An augmented Lagrangian approach with general constraints to solve nonlinear models of the large-scale reliable inventory systems
A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops
Composition of Graphs and the Triangle-Free Subgraph Polytope
Parallel solutions for ordinal scheduling with a small number of machines
A Tight Semidefinite Relaxation of the MAX CUT Problem
Mathematical models for the one-dimensional cutting stock problem with setups and open stacks
Power domination with bounded time constraints
On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design
Spectral influence in networks: an application to input-output analysis
Modified Greedy Heuristic for the one-dimensional cutting stock problem
A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP
Near optimal solutions for maximum quasi-bicliques
Upper bounds for the total rainbow connection of graphs
Solving (k-1)-stable instances of k-terminal cut with isolating cuts
On improving convex quadratic programming relaxation for the quadratic assignment problem
On (s, t)-relaxed L(2, 1)-labelings of the triangular lattice
On the chromatic number of P 5 -free graphs with no large intersecting cliques
A study of feature representation via neural network feature extraction and weighted distance for clustering
Linear time construction of 5-phylogenetic roots for tree chordal graphs
Nonnegative partial s-goodness for the equivalence of a 0-1 linear program to weighted linear programming
Models and Bounds for Two-Dimensional Level Packing Problems
Efficient point coverage in wireless sensor networks
Multiple phase neighborhood Search - GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
Verifying safety critical task scheduling systems in PPTL axiom system
Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles
An exponential (matching based) neighborhood for the vehicle routing problem
Optimal all-to-all personalized exchange in d -nary banyan multistage interconnection networks
On the max-weight edge coloring problem
Matroid-rooted packing of arborescences
Possible winner problems on partial tournaments: a parameterized study
Performance Analysis and Improvement for Some Linear On-Line Bin-Packing Algorithms
The Pfaffian property of Cartesian products of graphs
Algorithms for finding maximum transitive subtournaments
Path survival reliabilities as measures of reliability for lifeline utility networks
Guaranteeing fairness and efficiency under budget constraints
A characterization of optimal multiprocessor schedules and new dominance rules
Online maximum matching with recourse
Connected power domination in graphs
Randomized Online Scheduling with Delivery Times
Efficient estimation of the modified Gromov-Hausdorff distance between unweighted graphs
Finding an anti-risk path between two nodes in undirected graphs
Algorithms for storage allocation based on client preferences
A New delay control method for real-time flows
A new upper bound for the online square packing problem in a strip
On the extremal graphs with respect to the total reciprocal edge-eccentricity
Hardness of k -Vertex-Connected Subgraph Augmentation Problem
On metric dimension of plane graphs with $\frac{m}{2}$ number of 10 sided faces
The signed edge-domatic number of nearly cubic graphs
Frequency allocation problem over an algebraic structure
Maximally even sets and configurations: common threads in mathematics, physics, and music
A parameterized perspective on packing paths of length two
Finding disjoint paths on edge-colored graphs: more tractability results
Balanced tree partition problems with virtual nodes
A sufficient condition for a tree to be (Δ+1)-(2, 1)-totally labelable
Selecting intervals to optimize the design of observational studies subject to fine balance constraints
Logical Constraints as Cardinality Rules: Tight Representation
Rescheduling problems with allowing for the unexpected new jobs arrival
Neighbor sum distinguishing index of 2-degenerate graphs
Algorithms for the minimum diameter terminal Steiner tree problem
Congestion games with mixed objectives
Zero forcing versus domination in cubic graphs
Generalized median graphs and applications
Capacitance pin defect detection based on deep learning
Model and algorithm of routes planning for emergency relief distribution in disaster management with disaster information update
Transitivity in some graph-classes
Optimal space coverage with white convex polygons
Two-stage submodular maximization under curvature
Fast approximation algorithm for non-monotone DR-submodular maximization under size constraint
Secure Italian domination in graphs
The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle
Improving an upper bound on the size of k-regular induced subgraphs
The longest commonly positioned increasing subsequences problem
Sublinear-time algorithms for tournament graphs
Planar graphs without 4- and 6-cycles are (7 : 2)-colorable
A linear ordering problem with weighted rank
Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models
Sequence Independent Lifting in Mixed Integer Programming
An effective link prediction method in multiplex social networks using local random walk towards dependable pathways
Degree and betweenness-based label propagation for community detection
A combination of TEXTCNN model and Bayesian classifier for microblog sentiment analysis
Recoverable robust spanning tree problem under interval uncertainty representations
Finding a Noncrossing Steiner Forest in Plane Graphs Under a 2-Face Condition
Separator-based data reduction for signed graph balancing
List 2-distance $$\varDelta +3$$ Δ + 3 -coloring of planar graphs without 4, 5-cycles
The minimum chromatic spectrum of 3-uniform C-hypergraphs
Retraction Note: ARX and ARMAX modelling of SBCNC-60 machine for surface roughness and MRR with optimization of system response using PSO
A surgical scheduling method considering surgeons' preferences
Co-2-plex vertex partitions
On total colorings of 1-planar graphs
A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks
An almost four-approximation algorithm for maximum weight triangulation
Semidefinite Programming Relaxations for the Quadratic Assignment Problem
Controlling epileptic seizures in a neural mass model
MapReduce machine covering problem on a small number of machines
Online bin packing with (1, 1) and (2, R) bins
Operating room planning and surgical case scheduling: a review of literature
On the computational hardness based on linear FPT-reductions
Paired-domination in generalized claw-free graphs
Scheduling in Switching Networks with Set-Up Delays
Minimum power assignment in wireless ad hoc networks with spanner property
Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem
Solving the optimal order quantity with unknown parameters for products with stock-dependent demand and variable holding cost rate
Competitive algorithm for scheduling of sharing machines with rental discount
Approximation algorithms for distance constraint sweep coverage with base stations
Quaternion-based formulations for volume maximisation problems
Combinatorial optimization analysis of the production process of C4 olefins from ethanol based on the PSO-BP algorithm
Parameterized dominating set problem in chordal graphs: complexity and lower bound
A unified linear-programming modeling of some topological indices
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
Generalized acyclic edge colorings via entropy compression
Robust static and dynamic maximum flows
Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
Linear algebraic approach to an edge-coloring result
Parameterizations of hitting set of bundles and inverse scope
Two smaller upper bounds of list injective chromatic number
2-Distance list (Δ +2)-coloring of planar graphs with girth at least 10
The Maximum Box Problem for moving points in the plane
Research on shale gas productivity prediction method based on optimization algorithm
A combinatorial model and algorithm for globally searching community structure in complex networks
Discount allocation for cost minimization in online social networks
Retraction Note: Spatial-temporal deep learning model based rumor source identification in social networks
Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
Polynomial algorithms for canonical forms of orientations
Approximation algorithms for Median Hub Location Problems
Flattening topologically spherical surface
Retraction Note: On Aα-spectrum of a unicyclic graph
The seeding algorithm for k-means problem with penalties
Paired-domination number of claw-free odd-regular graphs
A new effective branch-and-bound algorithm to the high order MIMO detection problem
On cyclic vertex-connectivity of Cartesian product digraphs
L(j, k)-labeling number of Cartesian product of path and cycle
Minimizing the sum cost in linear extensions of a poset
All-Different Polytopes
Improved algorithms for largest cardinality 2-interval pattern problem
Online leasing problem with price fluctuations under the consumer price index
Online k-color spanning disk problems
Uav trajectory optimization for maximizing the ToI-based data utility in wireless sensor networks
Approximation Algorithms for Quadratic Programming
Cost-efficient scheduling on machines from the cloud
Fitting and analyzing data with convex-area-wise linear regression models
On the Bandpass problem
Neighbor sum distinguishing list total coloring of subcubic graphs
Finding the anti-block vital edge of a shortest path between two nodes
Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron
Single-machine online scheduling of jobs with non-delayed processing constraint
Worst-case analysis for on-line service policies
L(2, 1)-labelings of the edge-path-replacement of a graph
Distance graphs on R n with 1-norm
On parameterized approximation algorithms for balanced clustering
Graphs with large paired-domination number
Packing cycles exactly in polynomial time
The m-Steiner Traveling Salesman Problem with online edge blockages
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
Power Assignment for k -Connectivity in Wireless Ad Hoc Networks
A new bound on maximum independent set and minimum connected dominating set in unit disk graphs
An optimized approach of venous thrombus embolism risk assessment
Robustly assigning unstable items
Average eccentricity, minimum degree and maximum degree in graphs
An optimal Tate pairing computation using Jacobi quartic elliptic curves
Fixed-parameter tractability of anonymizing data by suppressing entries
A short proof of a result on a Vizing-like problem for integer total domination
Combinatorial Optimization in Real-Time Scheduling: Theory and Algorithms
b-Tree Facets for the Simple Graph Partitioning Polytope
On list r-hued coloring of planar graphs
Book Review: Discrete Analysis and Operation Research
DVS scheduling in a line or a star network of processors
Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance
Finding longest increasing and common subsequences in streaming data
Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors
Subset sum problems with digraph constraints
New construction of error-correcting pooling designs from singular linear spaces over finite fields
On list (p, 1)-total labellings of special planar graphs and 1-planar graphs
Degree bounded bottleneck spanning trees in three dimensions
On some path-critical Ramsey numbers
A new graph parameter and a construction of larger graph without increasing radio k-chromatic number
On the König deficiency of zero-reducible graphs
An estimator for matching size in low arboricity graphs with two applications
Suboptimal sliding manifold For nonlinear supply chain with time delay
Algorithms for randomized time-varying knapsack problems
Total coloring of planar graphs without adjacent chordal 6-cycles
Medial Axis and Optimal Locations for Min-Max Sphere Packing
Two-agent scheduling problems on a single-machine to minimize the total weighted late work
On single machine scheduling with resource constraint
Approximation algorithm for partial positive influence problem in social network
Minimum 2-distance coloring of planar graphs and channel assignment
A study on cyclic bandwidth sum
An approximation algorithm for k-facility location problem with linear penalties using local search scheme
Monochromatic disconnection: Erdős-Gallai-type problems and product graphs
Online multiple one way non-preemptive time series search with interrelated prices
Approximation algorithms for the W-prize-collecting scheduling problem on a single machine with submodular rejection penalties
Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing
Parameterized algorithms for min-max 2-cluster editing
Maximizing target-temporal coverage of mission-driven camera sensor networks
Total and paired domination numbers of C m bundles over a cycle C n
Retraction Note: Identifying vital nodes in hypernetwork based on local centrality
An approximation algorithm for the partial vertex cover problem in hypergraphs
Efficient reassembling of graphs, part 1: the linear case
The complexity of total edge domination and some related results on trees
Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13
Large even factors of graphs
A divide-and-conquer based preprocessing for routing in a simple polygon
Packing parameters in graphs: new bounds and a solution to an open problem
A 75 ° Angle Constraint for Plane Minimal T1 Trees
Spanning tree of a multiple graph
Design of extended dense coding protocol strategy based on combinatorial optimization
Approximation algorithms for the lower bounded correlation clustering problem
Analysis of consensus sorting via the cycle metric
Comments on the Paper: Attacking the Market Split Problem with Lattice Point Enumeration
Perceived service quality's effect on patient loyalty through patient attitude within the context of traditional Chinese medicine
Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT
A scenario-based robust optimization with a pessimistic approach for nurse rostering problem
Total coloring of planar graphs without short cycles
L(d, 1)-labelings of the edge-path-replacement by factorization of graphs
OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks
Minimum-segment convex drawings of 3-connected cubic plane graphs
Algorithmic and complexity aspects of problems related to total Roman domination for graphs
Linear-size universal discretization of geometric center-based problems in fixed dimensions
A simplex like approach based on star sets for recognizing convex-QP adverse graphs
Analysis of the List Scheduling Algorithm for Precedence Constrained Parallel Tasks
W-prize-collecting scheduling problem on parallel machines
Estimating the number of basins of attraction of multi-objective combinatorial problems
New analysis and computational study for the planar connected dominating set problem
An improved two-machine flowshop scheduling with intermediate transportation
Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem
Pareto optimal equilibria for selfish bin packing with uniform cost sharing
On the extremal cacti of given parameters with respect to the difference of zagreb indices
Single-machine multitasking scheduling with job efficiency promotion
The weighted link ring loading problem
Packing trees in communication networks
Online learning under one sided σ-smooth function
Optimal arrangement of the pulmonary interventional surgeries considering timely distribution of medical consumables
An Improved Randomized Approximation Algorithm for Max TSP
The price of fairness for a two-agent scheduling game minimizing total completion time
Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
Tropical paths in vertex-colored graphs
Online scheduling on a single machine with linear deteriorating processing times and delivery times
Lower bounds for independence numbers of some locally sparse graphs
Big data driven urban railway planning: Shenzhen metro case study
Two-machine flow shop scheduling with an operator non-availability period to minimize makespan
Online economic ordering problem for deteriorating items with limited price information
Further results on the total monochromatic connectivity of graphs
Greedy algorithms for the profit-aware social team formation problem
Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
A balm: defend the clique-based attack from a fundamental aspect
Preface: special issue on the annual international conference on combinatorial optimization and applications (COCOA)
Approximate weak efficiency of the set-valued optimization problem with variable ordering structures
L(d, 1)-labelings of the edge-path-replacement of a graph
Online integrated production-distribution scheduling problems without preemption
Vehicle scheduling problems with two agents on a line
Online scheduling with a buffer on related machines
Distance two edge labelings of lattices
A green routing-location problem in a cold chain logistics network design within the Balanced Score Card pillars in fuzzy environment
Best routes selection in multimodal networks using multi-objective genetic algorithm
Approximation algorithm for the multicovering problem
The strong chromatic index of graphs with edge weight eight
Approximation algorithms for precedence-constrained identical machine scheduling with rejection
A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function
Maximizing diversity and persuasiveness of opinion articles in social networks
A bilevel programming problem with maximization of a supermodular function in the lower level
Spanning 3-connected index of graphs
Dynamic analysis of structures installed hysteretic dampers with hardening post-yielding stiffness using connection element method
An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding
Graph coloring by multiagent fusion search
Maximum cardinality neighbourly sets in quadrilateral free graphs
Computing the shortest reset words of synchronizing automata
The web proxy location problem in general tree of rings networks
Some inverse min-max network problems under weighted l 1 and l infinity norms with bound constraints on changes
Approximation approach for robust vessel fleet deployment problem with ambiguous demands
On judicious partitions of graphs
The weakly connected independent set polytope in corona and join of graphs
Algorithms with limited number of preemptions for scheduling on parallel machines
Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy
LP-based pivoting algorithm for higher-order correlation clustering
A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs
On the best possible competitive ratio for the multislope ski-rental problem
On combinatorial network flows algorithms and circuit augmentation for pseudoflows
A Probabilistic Analysis of the Capacitated Facility Location Problem
Three-dimensional stable matching with hybrid preferences
New algorithms for k -center and extensions
A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition
The wireless network jamming problem
The effect of vertex and edge deletion on the edge metric dimension of graphs
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period
List-edge-coloring of planar graphs without 6-cycles with three chords
Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
Triple-solution approach for the strip packing problem with two-staged patterns
A Polynomial Time Approximation Scheme for the Problem of Interconnecting Highways
Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions
Equal Processing Time Bicriteria Scheduling on Parallel Machines
A closest vector problem arising in radiation therapy planning
Mutually dependent, balanced contributions, and the priority value
Conflict-free connection of trees
Transport schemes for topology-transparent scheduling
Unfolding some classes of orthogonal polyhedra of arbitrary genus
Research on the impact of green innovation alliance mode on decision-making of two-cycle closed-loop supply chain
A simple optimal algorithm for k-tuple dominating problem in interval graphs
Scheduling with task replication on desktop grids: theoretical and experimental analysis
Approximating the probabilistic p-Center problem under pressure
Single machine batch scheduling with two non-disjoint agents and splitable jobs
An optimal streaming algorithm for non-submodular functions maximization on the integer lattice
On the relation between Wiener index and eccentricity of a graph
Multi-start iterated tabu search for the minimum weight vertex cover problem
On the maximum size of subfamilies of labeled set with given matching number
(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation
Online traveling salesman problem with deadlines and service flexibility
k-tuple total domination in cross products of graphs
Semi-online scheduling with "end of sequence" information
HM-EIICT: Fairness-aware link prediction in complex networks using community information