yusuke1997/dblp-id-title huggingface dataset:
Strategic planning in LTL logistics - increasing the capacity utilization of trucks
New results on connectivity of cages
Generating Graceful Trees from Caterpillars by Recursive Attachment
Edges incident with a vertex of degree greater than four and a lower bound on the number of contractible edges in a 4-connected graph
Snarks and Flow-Critical Graphs
Adjusted Interval Digraphs
On the local splitting theorem
The Generalized Max-Controlled Set Problem
Polyhedra associated with identifying codes
Optimal Designs for Covariates' Models and Mixed Orthogonal Arrays
10-tough chordal graphs are hamiltonian (Extended Abstract)
Computational Solution of an Old Tower of Hanoi Problem
Column Generation Method for an Agent Scheduling Problem
Finding the chromatic number by means of critical graphs
Product sets cannot contain long arithmetic progressions
The proper fiducial argument
A Concurrent Implementation of Skip Graphs
Radio Secure number of a Graph
Expected value of the minimal basis of random matroid and distributions of q-analogs of order statistics
A Note On q-Integral Operators
Bipartite sandwiches: semide?nite relaxations for maximum biclique
Graph minors and the crossing number of graphs
Quasirandomness in Graphs
Exact value of 3 color weak Rado number
Reconstruction of Discrete Sets from Four Projections: Strong Decomposability
A variable neighborhood search for multi-family capacitated lot-sizing problem
Global 2-Point Set Domination Number of a Graph
Distortion of the hyperbolicity constant in minor graphs
Risk Neutral and Risk Averse Models for Power Optimization under Uncertainty in Electricity Networks with Dispersed Generation
An alternative digital topology
Edge-maximal graphs of branchwidth k
Capacitated m Two-Node Survivable Star Problem
A Moore-like bound for mixed abelian Cayley graphs
On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs
A fast heuristic approach for train timetabling in a railway node
A minimum degree condition forcing a digraph to be k-linked
A polyhedral study of the acyclic coloring problem
Packing degenerate graphs greedily
A rainbow Erdős-Rothschild problem
Symmetry Breaking in Tournaments
Circulant graphs: efficient recognizing and isomorphism testing: (extended abstract)
On the (di)graphs with (directed) proper connection number two
New Classes of Graceful Unicyclic Graphs
Nonsymmetric configurations with line sizek=4
Incidence geometries for the finite symmetric groups
New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem
On d-dual hyperovals in PG(d(d+3)/2, 2)
The Maximum Independent Set Problem in Subclasses of S i, j, k -Free Graphs
On the strong metric dimension of product graphs
An asymmetric vehicle routing problem arising in the collection and disposal of special waste
Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality
Minimizing waiting times in a route design problem with multiple use of a single vehicle
Matching graphs of Hypercubes and Complete Bipartite Graphs
Searching with lies under error transition cost constraints
Radio number for middle graph of paths
General theory of information transfer
Extending the Single Machine-Based Relaxation Scheme for the Job Shop Scheduling Problem
Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
Optimizing diversity
Lehman's equation on near-ideal clutters
Optimal matrix-segmentation by rectangles
Embedding theorems with an exponential weight on the real semiaxis
On the general excess bound for binary codes with covering radius one
Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem
Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing
Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products
On chromatic polynomials of hypergraphs
Building PQR trees in almost-linear time
Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs
Finite Abelian Group Labeling
Aspects of Feynman Graphs
The bipartite edge frustration of hierarchical product of graphs
md-MST is NP-hard for d>=3
The sandwich problem for cutsets
Every hereditary permutation property is testable
Redundant Coupling/decoupling in Train Unit Scheduling Optimization
A hybrid genetic algorithm and variable neighborhood search for multi-family capacitated lot-sizing problem
Polynomial time algorithm for the Radon number of grids in the geodetic convexity
Minimal vertex separators and new characterizations for dually chordal graphs
The complexity of the chromatic sum problem on cubic planar graphs and regular graphs
The maximal restricted edge connectivity of Kautz undirected graphs: (extended abstract)
A general framework for nested variable neighborhood search
General variable neighborhood search for home healthcare routing and scheduling problem with time windows and synchronized visits
Computational complexity of edge modification problems in different classes of graphs
On pancyclism of hamiltonian graphs
A new intersection theorem and its applications to bounding the chromatic numbers of spaces
Computing Walsh Transform from the Algebraic Normal Form of a Boolean Function
Perfectly Orderable P 4 Composition
Optimization and reconstruction of hv-convex (0, 1)-matrices
Clique trees of chordal graphs: leafage and 3-asteroidals
Compact and Extended Formulations for the Virtual Network Embedding Problem
Better goodness-of-fit statistics for coded FSK decoding
Game-perfect Graphs with Clique Number 2
Results and Problems Concerning Edge Transformed Graphs
A particle swarm optimization approach for the bi-objective load balancing problem
On t-Cliques in k-Walk-Regular Graphs
Octagon kite systems
Contracting Bipartite Graphs to Paths and Cycles
Separation Algorithm for Tree Partitioning Inequalities
An elementary bound for the number of points of a hypersurface over a finite field (Summary)
Large Convex Cones in Hypercubes
Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract
On construction of bound graphs
A proof of Sumner's universal tournament conjecture for large tournaments
Flow-based formulation for the maximum leaf spanning tree problem
K 4 -expansions have the edge-Erdős-Pósa property
Reviewing some Results on Fair Domination in Graphs
A Median-Type Condition for Graph Tiling
A SA-VNS approach for the High School Timetabling Problem
Integral Free-Form Sudoku graphs
Linear-Interval Dimension and PI Orders
A Characterization of Graphs with Fractional Total Chromatic Number Equal to Delta+2
The Multicolour Ramsey Number of a Long Odd Cycle
New Terminology and Results for AVL Trees
Codes from translation schemes on Galois rings of characteristic 4
LD-Coloring of Regular Tiling (Extended Abstract)
On canonical decomposition of bipartite graphs
Diophantine m-tuples for quadratic polynomials
Polynomial Lower Bounds for the Two-Machine Flowshop Problem with Sequence-Independent Setup Times
Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees
On homomorphisms to edge-coloured cycles
The k-limited packing and k-tuple domination problems in strongly chordal, P 4 -tidy and split graphs
Acyclic Vertex Coloring of Graphs of Maximum Degree Six
On the Generalized Elementary Shortest Path Problem: A heuristic approach
A degree based approach to find Steiner Trees
AutoGraphiX: a survey
Impartial Solitaire Clobber played on Powers of Paths
A MILP-based VND for the min-max regret Shortest Path Tree Problem with interval costs
On the Mollard code as a partially robust code
A mixed-integer linear optimization model for a two-echelon agribusiness supply chain
Counting Spanning Trees in Cographs
Characterization by forbidden induced subgraphs of some subclasses of chordal graphs
Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets
A note on the primal-dual column generation method for combinatorial optimization
Constructing all minimum genus embeddings of K 3, n
Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model
321-avoiding affine permutations, heaps, and periodic parallelogram polyominoes
On the distribution of permanents of matrices over finite fields
Hamilton cycles in 6-connected claw-free graphs (Extended abstract)
The k-hop connected dominating set problem: hardness and polyhedra
Asymmetric Coloring Games on Incomparability Graphs
On sequential discrimination between close Markov chains
Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines
Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time
Hamiltonian graphs from Kirkman to König
On the Chvátal-rank of facets for the set covering polyhedron of circular matrices
Stabilized branch-and-cut-and-price for the generalized assignment problem
A quadratic programming problem arising from the p-version for obstacle problems
Nonrepetitive colorings of graphs
A Sharp Bound for the Marginal Appendage Number
Weil Descent Of Jacobians
Maximum size of a planar graph with given degree and diameter
Classification of optimal conflict-avoiding codes of weights 6 and 7
Parameterized complexity of the maximum independent set problem and the speed of hereditary properties
A sufficient condition for self-clique graphs
Closure of genomic sets: applications of graph convexity to genome rearrangement problems
Paired-domination of Cartesian products of graphs and rainbow domination
General Variable Neighborhood Search for the Data Mule Scheduling Problem
An exact DSatur-based algorithm for the Equitable Coloring Problem
Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers
Theta-graphs of partial cubes and strong edge colorings
Searching for perfection on hypergraphs
On the packing of trees into their power
An Inescapable Region for the Chessboard Pebbling Problem on Four Quadrants
VNS heuristic for the (r|p)-centroid problem on the plane
Hom complexes and homotopy in the category of graphs
A hybrid variable neighborhood search algorithm for targeted offers in direct marketing
Super Edge Magic Graceful Labeling of Generalized Petersen Graphs
On the chromatic number of a subgraph of the Kneser graph
Obstructions for Tree-depth
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
Strong and Weak Domination, Full Sets and Domination Balance in Semigraphs
Heuristic approaches to the Distinguishing Substring Selection Problem
Convex and extendable partitions of a lattice
A completely dynamic algorithm for split graphs
Investigations on cubic rotation symmetric bent functions
On the k-dominating set polytope of web graphs
Cut method and Djoković-Winkler's relation
Kneser ranks of random graphs and minimum difference representations
On Covering Z-Grid Points by Rectangles
An experimental study of the stability problem in discrete tomography
Column Generation based Primal Heuristics
A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization
A New Formulation for Spanning Trees
Bijections on two variations of noncrossing partitions
A characterization of Projective Subspaces of Codimension two as Quasi-Symmetric Designs with Good Blocks
Some properties of the skeleton of the pyramidal tours polytope
On strongly circular-perfectness
A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
Chromatic number of sparse colored mixed planar graphs
Bounding the Clique-Width of H-free Split Graphs
On the recognition of neighborhood inclusion posets
A variable neighborhood search for the multi-product inventory routing problem
Graph Operations and Zipfian Degree Distributions
Chromatic spectrum is broken
Enumeration of labeled 4-regular planar graphs
T-shift synchronization codes
Codings of rotations on two intervals are full
An IO-Modification of Potential Method
Ratewise-optimal non-sequential search strategies under cardinality constraints on the tests
ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors
Families of Very Different Paths
Approximating Max Cut with Limited Unbalance
SAT Distributions with Phase Transitions between Decision and Optimization Problems
Minimum Cost <=k Edges Connected Subgraph Problems
Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem
Some Related Functions to Integer GCD and Coprimality
A Genetic Algorithm for a class of Critical Node Problems
Simultaneous Scheduling, Binding and Routing for Coarse-Grain Reconfigurable Architectures
Geometry of poset antimatroids
Recoloring bounded treewidth graphs
A criterion for maximal (minimally non-) outer planarity of total-block graph of a graph
On hereditary Helly self-clique graphs
From Arrow's Theorem to Incentives and Price Dynamics
Polyhedral studies on the convex recoloring problem
Color quantization by pairwise clustering using a reduced graph
Convergence Time to Nash Equilibrium in Selfish Bin Packing
On Integral Sum Graphs
Coloring parameters for graphs on surfaces
On the Path Separability of Planar Graphs
A Gray code for binary subtraction
Generation of Key Predistribution Schemes using Secret Sharing Schemes
Isoperimetric inequalities in graphs and surfaces
A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives
On a Stackelberg Subset Sum Game
Problems and results in P G (2, q )PG(2, q)
Graphs of odd girth 7 with large degree
Minimizing the weighted sum of completion times under processing time uncertainty
1-restricted Simple 2-matchings: (Extended Abstract)
Polynomial approximation for the number of all possible endpoints of a random walk on a metric graph
Hop-indexed Circuit-based formulations for the Traveling Salesman Problem
Non-Separable Detachments of Graphs
Forbidden induced subgraph characterizations of subclasses and variations of perfect graphs: A survey
On the average path length of a cycle plus random edges
Small separations in vertex-transitive graphs
On upper bound graphs with forbidden subposets
The knapsack problem with scheduled items
Replicated Parallel Strategies for Decomposition Guided VNS
A note on multiple coverings of the farthest-off points
The final answer to the complexity of a basic problem in resilient network design
On characterizations by nice forbidding sets
Forbidden Configurations: Boundary Cases
Diagonal forms for incidence matrices and zero-sum Ramsey theory
Weighted perfect codes in Lee metric
Two Dimensional Knapsack with Unloading Constraints
A distributed algorithm for k-dominating sets
On Pedigree Polytopes and Hamiltonian Cycles
Disjoint Even Cycles Packing
Graphs, intersections of subgroups of free groups and corank
Visibility graphs of point sets in the plane
On the diameter of reconfiguration graphs for vertex colourings
On limits of sparse random graphs
Log-concavity for Bernstein-type operators using stochastic orders
New methods for the Distance Geometry Problem
Priority-Consistent Graphs
A Faster Test for 4-Flow-Criticality in Snarks
Smart Meter Tariff Design to Minimise Wholesale Risk
On attractive and friendly sets in sequence spaces
Simple Undirected Two-Commodity Integral Flow with a Unitary Demand
Farey Sequences and Discrete Radon Transform Projection Angles
Rapid transit network design considering risk aversion
Odd Mean Labeling of Chain of Graphs
Nearly Optimal Partial Steiner Systems
An O(n 2.75 ) algorithm for online topological ordering
On Steiner 2-edge connected polytopes
The obnoxious center problem on weighted cactus graphs (Extended Abstract)
Edge Addition Number of Cartesian Product of Paths and Cycles
A New Formulation and Computational Results for the Simple Cycle Problem
Degree and Distance Based Topological Indices of Graphs
2-closed abelian permutation groups
Short coverings and matching in weighted graphs
Understanding and modeling the inter-play between Sustainability, Resilience, and Robustness in networks
Distance Antimagic Labeling of the Ladder Graph
Algorithm for Recognizing Cartesian Graph Bundles
The Solitaire Clobber game and correducibility
Total Chromatic Number and Some Topological Indices
Partitions of the Klein Quadric
A characterization of biconnected graphs reachable by robots jumping over m obstacles
The complexity of arc-colorings for directed hypergraphs
Submodular Formulations for Range Assignment Problems
New scheduling problems coming from grid computing
On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width
Polynomial Time Algorithms for Determining Optimal Strategies
Weak regularity and finitely forcible graph limits
On the Erdös-Szekeres problem in combinatorial geometry
Randolphs Robot Game is NP-hard!
Characterizing Simultaneous Embedding with Fixed Edges
The Single Polybag Loading Problem
Digitalizing line segments
Some Algorithms on Conditionally Critical Indecomposable Graphs
Minimal matrices and discrete tomography
Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number
Incidentor coloring of weighted multigraphs
On the maximum modulus points, deviations of meromorphic functions and a problem of Erdös
A Branch-and-cut-and-price algorithm for the Stackelberg Minimum Spanning Tree Game
Hamilton cycles in maximal planar graphs
On the power graph of the direct product of two groups
Clustering cities based on their development dynamics and Variable neigborhood search
Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs
Exploiting Separators for Guiding VNS
Mathematical Analysis of caching policies and cooperation in YouTube-like services
Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors
Edge Coloring by Total Labelings of 4-regular Circulant Graphs
Primal-dual simplex method for shooting
Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint
Advances in packing directed joins
Linear time algorithms for finding sparsest cuts in various graph classes
A hybrid heuristic based on General Variable Neighborhood Search for the Single Vehicle Routing Problem with Deliveries and Selective Pickups
A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs
A Simulated Annealing with Variable Neighborhood Search Approach to Construct Mixed Covering Arrays
Threshold functions for small subgraphs: an analytic approach
Simple vertex ordering characterizations for graph search: (expanded abstract)
Forbidden structures for efficient First-Fit chain partitioning (extended abstract)
Optimal Mapping of Cloud Virtual Machines
Krein-Milman Spaces
Application of cover-free codes and combinatorial designs to two-stage testing
Fast Searching in Trees
A Proof for a Conjecture of Gorgol
On the min DSS problem of closed discrete curves
Fast winning strategies in positional games
Stronger upper and lower bounds for a hard batching problem to feed assembly lines
Pebbling Graphs of Diameter Three and Four
A simple dual ascent algorithm for the multilevel facility location problem
A variable neighborhood search approach for the crew pairing problem
Congruent Dudeney Dissections of Polygons I: All the Hinge Points are Vertices of the Polygon
The Football Pool Polytope
q-Stirling numbers of the second kind and q-Bell numbers for graphs
Determining the minimum rank of matroids whose basis graph is common
Small degeneracy of antiferromagnetic triangulations
A Strengthened General Cut-Generating Procedure for the Stable Set Polytope
A forbidden subgraph characterization of path graphs
Special asteroidal quadruple on directed path graph non rooted path graph
Lower Bounds for the Minimal Sum Coloring Problem
Balance in graph-designs
Estimation of Noisy Data: The Case of Partially Missing Information
Fast generation of some classes of planar graphs
The Dominance Flow Shop Scheduling Problem
4th International Conference on Variable Neighborhood Search (ICVNS'16)
On consecutive magic graphs
Characterization of the hyperbolicity in the lexicographic product
A 6 -invariant ovoids of the Klein quadric
3-uniform hypergraphs and linear cycles
On a Conjecture of Fan and Raspaud
A Local Epsilon Version of Reed's Conjecture
Extension of paths and cycles for hypergraphs
Some Applications of the Schutzenberger-Bertoni Method
Lower Bounding Techniques for DSATUR-based Branch and Bound
Extremal K (s, t) -free bipartite graphs
The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut
A Satisfiability Formulation of Problems on Level Graphs
Perfect Matchings of the Small Polyominoes
Estimation of Expressions' Complexities for Two-Terminal Directed Acyclic Graphs
Reconstruction of discrete sets from two absorbed projections: an algorithm
Variable neighborhood search for optimizing the transportation of agricultural raw materials
Taming reluctant random walks in the positive quadrant
Strongly regular Cayley graphs and rationality of relative Gauss sums
Alternating TSP and Printed Circuit Board Assembly
Blocking Sets in P G ( r , q 2 n )PG(r, q2n)
Large Bd-free and union-free subfamilies
An adaptive variable neighborhood search for solving the multi-objective node placement problem
Envy-free division of discrete cakes
On planar graphs with large tree-width and small grid minors
Decomposing recurrent states of the abelian sandpile model
On minimal non [h, 2, 1] graphs
Alignment with non-overlapping inversions in O(n 3 logn)-time
Rhombus tilings: decomposition and space structure: (extended abstract)
On k-chromatically unique and k-chromatically equivalent hypergraphs
On Tverberg's theorem
A lower bound for the sum of the two largest signless Laplacian eigenvalues
Simple 2-fold (3 n , n , 3)(3n, n, 3) group divisible designs having a prescribed number of triples in common
Proper connection number 2, connectivity, and forbidden subgraphs
Empirical study of variable neighbourhood search applied to the optimization of the internal delivery vehicles at maritime container terminals
A Set Partitioning Approach to Shunting
Automorphisms group of generalized Hamming Graphs
Forbidden minors and subdivisions for toroidal graphs with no K 3, 3 's
Minimizing the Oriented Diameter of a Planar Graph
Intersection graphs on trees with a tolerance
Parameters of connectivity in (a, b)-linear graphs
The lexicographic product of some chordal graphs and of cographs preserves b-continuity
New Reoptimization Techniques applied to Steiner Tree Problem
Radio Numbers of Some Caterpillars
Further Results on Set Sequential and Set Graceful Graphs
The New Feature Selection Method Based on the Interclass Distinguishibility and the Generality of Class Description
Total chromatic number of graphs with small genus
Image Segmentation by Dominant Sets
E-Super Vertex Magic Regular Graphs of Odd Degree
Counting Lattice Paths with an Infinite Step Set and Special Access
Set Labelling Vertices To Ensure Adjacency Coincides With Disjointness
The Helly property on subhypergraphs
New conjectures on perfect matchings in cubic graphs
On the Probability of Error for Triangular Quadrature Amplitude Modulation
Exact algorithms for a discrete metric labeling problem
On Segre's Lemma of Tangents
Negative Circles in Signed Graphs: A Problem Collection
Towards Optimal and Scalable Solution for Routing and Spectrum Allocation
Generalized clique family inequalities for claw-free graphs
The Relation between the no-wait Job Shop Problem and the Traveling Salesman Problem
Group distance magic and antimagic graphs
Partial Characterizations of Circular-Arc Graphs
Finding good tree decompositions by local search
Graphs with large girth are b-continuous
Partial permutation decoding for binary linear Hadamard codes
A new algorithm and a new type of estimate for the smallest size of complete arcs in P G (2, q )PG(2, q)
Revisiting Tucker's Algorithm to Color Circular-Arc Graphs
Variable Neighborhood Search for Google Machine Reassignment problem
Rank-width and Well-quasi-ordering of Skew-symmetric Matrices: (extended abstract)
Recovering the conductances on grids
Non-preemptive Profile Scheduling and Quasi Interval Orders
Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines