yusuke1997/dblp-id-title huggingface dataset:
Search for the best compromise solution on Multiobjective shortest path problem
Variable neighborhood descent search based algorithms for course timetabling problem: Application to a Tunisian University
The group inverse of subdivision networks
Universal Lower Bounds on Energy and LP-Extremal Polynomials for (4, 24)-Codes
Variable neighborhood search accelerated column generation for the nurse rostering problem
Hamiltonian Cycles in Kneser Graphs for n=2k+2
A Randomized Variable Neighborhood Descent Heuristic to Solve the Flying Sidekick Traveling Salesman Problem
Degree Conditions and Degree Bounded Trees
Line Languages
Co-Bipartite Neighborhood Edge Elimination Orderings
On the facets of the lift-and-project relaxations of graph subdivisions
An O(n 2 ) Algorithm for the Characteristic Polynomial of a Tree
Enumerating solution-free sets in the integers
An Approximation Algorithm for Multiroute Flow Decomposition
Vertex equitable labeling of signed graphs
Load Balancing Optimization of Capacitated Networks with Path Protection
Minimum density of identifying codes of king grids
Scaffolding skeletons using spherical Voronoi diagrams
Properties of Groups for the Cage and Degree/Diameter Problems
There are exactly five biplanes with k=11
Neighbor-locating coloring: graph operations and extremal cardinalities
A comparative study of some evolutionary algorithms
Decomposing series-parallel graphs into paths of length 3 and triangles
Point Set and Strong Point Set Domination in Graphs 1 Minimum spsd sets
On V-super and E-super vertex-magic total labelings of graphs
The incidence game chromatic number
On the first Zagreb Index of Polygraphs
The minimum cut cover problem
E-Super Vertex In-Magic Total Labelings of Digraphs
The generalized split probe problem
Uniform Linear Embeddings of Spatial Random Graphs
A Hybrid Metaheuristic Based on Variable Neighborhood Search and Tabu Search for the Web Service Selection Problem
Short Models for Unit Interval Graphs
D(z)-quadruples in the ring Z{sqrt(-2)], for some exceptional cases of z
Variable Neighborhood Search for Solving the Balanced Location Problem
New designs from circular nearrings
On Weighted PI Index of Graphs
On a Ramsey-type problem of Erdős and Pach
Maximal Binary Cliques
Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems
Online Bounded Coloring of Permutation and Overlap Graphs
Optimal Client-Server Configuration of Mobile Ad-Hoc Networks
Winning fast in fair biased Maker-Breaker games
On the average Cartier-Foata height of traces
Self-complementary hypergraphs and their self-complementing permutations
Theorem Proving with Structured Theories (Preliminary Report) *
Column generation based primal heuristics for routing and loading problems
On quadrangulations and Stokes complexes
Coloring permutation graphs in parallel
Characterization of Cycle Stochastic Graphs
Light subgraphs of multigraphs embedded in compact 2-manifolds
The Painlevé Equations and Orthogonal Polynomials
The Path repair algorithm
Algorithms based on VNS for solving the Single Machine Scheduling Problem with Earliness and Tardiness Penalties
LAGOS 2017 - IX Latin and American Algorithms, Graphs, and Optimization Symposium
Erdős-Tur'an-Type Discrepancy for the Zeros of Rational Functions
Clique Covers in Claw-Free Berge Graphs
Note on three table Oberwolfach problem
2-star-coloring of graphs
Ordinal Measurement in Decision Aid
All Graphs Have Antimagic Total Labelings
On cross-sections of partial wreath product of inverse semigroups
Polynomial Time Recognition of Uniform Cocircuit Graphs
Combinatorial bounds on paired and multiple domination in triangulations
Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem
Chain ring analogs of designs
Ensemble-based prediction of SAT search behaviour
Graph decompositions definable in monadic second-order logic
On oriented relative clique number
On the Use of Learning Automata for Energy Saving in Optical Backbone Networks
Test Sets for Vertex Cover Problems
Edge-Graceful Labelings of Connected Graphs
A note on Random Homomorphism from ArbitraryGraphs to Z
On constructions of hypotraceable graphs
Adjacent-Resource Scheduling: Why spatial resources are so hard to incorporate
On the k-edge magic graphs
Kinematics and dynamics motion planning by polar piecewise interpolation and geometric considerations
Generalization of Achromatic Colouring of Central Graphs
When do combinatorial structures obey the Poisson-Dirichlet law?
Efficient and Perfect domination on circular-arc graphs
Grammar-Based Integer Programming Models for Multi-Activity Shift Scheduling
Preface: Volume 6
Application of a discrete tomography algorithm to computerized tomography
The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes
Single Item Multi-period Multi-retailer Inventory Replenishment Problem with Restricted Order Size
On Extremal Hypergraphs for Hamiltonian Cycles
Cycles and matchings in randomly perturbed digraphs and hypergraphs
Submodularity and Randomized rounding techniques for Optimal Experimental Design
Universal exponents and tail estimates in the enumeration of planar maps
On the existence of uniquely partitionable graphs
Tags on Subsets
Large families of pseudorandom sequences of k symbols and their complexity, Part I
b-Chromatic Sum of Mycielskian of Paths
Regular chromatic number and the lonely runner problem
DNA Fragments Assembly Programs: a comparative study
Characterizing (k, l)-partitionable Cographs
On the complexity of a Virtual Network Function Placement and Routing problem
VNS matheuristic for a bin packing problem with a color constraint
New examples of fractional dimensional semifield planes
Counting coloured planar maps
On a star chromatic index of subcubic graphs
Colouring Some Classes of Perfect Graphs Robustly
Global offensive alliances in graphs
Delta-Wye Transformations and the Efficient Reduction of Almost-Planar Graphs
Algorithms and formulations for the minimum cut separator problem
Order Batching and Routing in a Non-Standard Warehouse
Optimal partition of a bipartite graph into non-crossing matchings
Classification of the smallest minimal 1-saturating sets in PG (2, q ), q ≤23
Edge Intersection Graphs of L-Shaped Paths in Grids
On graphs with the same restricted U -polynomial and the U -polynomial for rooted graphs
An infinite family of sharply two-arc transitive digraphs
Automorphisms of hyperelliptic GAG-codes
All Lobsters with Perfect Matchings are Graceful
The Harmonious Chromatic Number of Deep and Wide Complete n- ary Trees
Contractible edges in a k-connected graph (K 1 + P 4 )-free graph
Homogeneously almost self-complementary graphs
Integer sequences and dynamics
On the Existence of Nearly Kirkman Triple Systems with Subsystems
A Computational Study of Lower Bounds for the Two Dimensional Bin Packing Problem
A Two-stage Model for a Day-ahead Paratransit Planning Problem
New Largest Graphs of Diameter 6: (Extended Abstract)
Dimensions of chains of relations
Trees with minimum F-coindex
NP-completeness of the {k}-packing function problem in graphs
Selecting Complementary Pairs of Literals
Families of small regular graphs of girth 7
Dominating Coloring Number of Claw-free Graphs
SPT(q, k, n)-Codes
Disconnected Complements of Steinhaus graphs
General Variable Neighborhood Search applied to the picking process in a warehouse
k-metric resolvability in graphs
On embedding triconnected cubic graphs on point sets
On Coxeter spectral study of finite posets using computer algebra tools
Polyhedral aspects of partial orders and comparability graphs
A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows
Combinatorial Optimization of Capacity and Flow Assignment Problem for Unicast and Anycast Connections with Linear and Convex Objective Functions - Exact and heuristic Algorithms
A density Corrádi-Hajnal theorem
Optimizing allocation in a warehouse network
Lattice paths with periodic boundaries
Removing Even Crossings on Surfaces
Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story
A note on the disjunctive index of joined a-perfect graphs
Expressing Polynomials as the Permanent of low rank Square Matrices
An extended edge-representative formulation for the K-partitioning problem
Optimal information measures for weakly chaotic dynamical systems
Chromatic index, treewidth and maximum degree
Polygon-circle and word-representable graphs
Partition Designs with two subsets of the Hamming Space
Note on Lift-and-Project Ranks and Antiblocker Duality
Connectivity augmentation in plane straight line graphs
On a degree sequence analogue of Pósa's conjecture
An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization
Contributions to Mathematical Psychology: the 2011 Meeting of the EMPG
On the Structure of Contractible Vertex Pairs in Chordal Graphs
Homomorphisms of separoids
Asteroidal Chromatic Number of a Graph
A Connectivity Lemma
On the Sharpness of the Griesmer Bound
An Approximation Algorithm for the Two-Node-Connected Star Problem with Steiner Nodes
Edge identifying codes
Integrating job scheduling and constrained network routing
Z 4 -linear Hadamard and extended perfect codes
A polynomial algorithm for the k-cluster problem on the interval graphs
Homomorphisms of 2-edge-colored graphs
Acyclic improper choosability of graphs
Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three
An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points
Tight Cycles in Hypergraphs
On packing spanning arborescences with matroid constraint
On the Plane-Width of Graphs
Formulae and Growth Rates of High-Dimensional Polycubes
Equivalent Nonlinear Complementarity Problem for Chance-constrained Games
Gallai's conjecture for graphs with treewidth 3
Trees with three leaves are (n + l)-unavoidable
Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem with Adjacency Costs
More on Connector Families
Polynomial traffic demand polytope partitioning
Enumeration of RNA Hairpins and Cloverleaves
Bipartite operator decomposition of graphs and the reconstruction conjecture
Matching Theory and Economic Model Building
VNS solutions for the Critical Node Problem
Further results on the radio number of trees
Limited Packings in Graphs
Distance-Hereditary 5-Leaf Powers
Approximating Minimum k-Section in Trees with Linear Diameter
More on the crossing number of K n : Monotone drawings
Bilevel Model for Adaptive Network Flow Problem
A heuristic for large-scale p-median instances
Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder
Split Orders
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges
Counting Homomorphisms to Sparse Graphs
On Simplices Embracing a Point
On the Minimum Weights of Type IV Codes over I 4 with Certain Lengths
Highly connected star product graphs
Transitive convex subsets in large tournaments
On Some Extremal Properties of Hypergraph Colorings
Marking Games
4-cycles at the triangle-free process
On the Optimality of Finite Constellations from Algebraic Lattices
Variable neighborhood descent heuristic for covering design problem
Some Parameters on Neighborhood Number of A Graph
The Design of Transparent Optical Networks Minimizing the Impact of Critical Nodes
Planar width of regular maps
Proving unsatisfiability of CNFs locally
Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs
Proper Hamiltonian Paths in Edge-Colored Multigraphs
Existence and colouring of configurations with line size k=4
Kirchhoff index of a non-complete wheel
New necessary and sufficient conditions on (a i , m i ) in order that x = a i (mod m i ) be a covering system
Discovering Frequent Itemset with Maximum Time-Window on Temporal Transaction Database using Variable Neighborhood Search
Additive number theory and the ring of quantum integers
Vertex Coverings by Coloured Induced Graphs - Frames and Umbrellas
How many points can be reconstructed from k projections?
A polyhedral study of the maximum edge subgraph problem
A performance study on multi improvement neighborhood search strategy
On the difference between hamilton cycles and 2-factors with a prescribed number of cycles
On asymmetric communication protocols
Graph Theory and Economic Models: from Small to Large Size Applications
Symmetry and connectivity in G-graphs
Pruned discrete random samples
A particular class of graphic matroids
On I -sparse graphs and other families: Extended abstract
On (k, d)-Skolem Graceful Graphs
Ramsey numbers of ordered graphs
Every Z 2k -Code is a Binary Propelinear Code
A one-dimensional bin packing problem with shelf divisions
A strong symmetric formulation for the Min-degree Constrained Minimum Spanning Tree Problem
New designs by changing ... the signs
Archimedean solids of genus two
On Clique-inverse graphs of K p -free graphs
Critical graphs for clique-coloring
On the correlation of binary sequences
Fast approximation schemes for K 3, 3 -minor-free or K 5 -minor-free graphs
Generalizing Erdős, Moon and Moser's result - The number of k-dominating independent sets
Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs
On some applications of randomized memory
Minimal condition for shortest vectors in lattices of low dimension
On the queue-number of the hypercube
Bipartite Kneser graphs are Hamiltonian
Quasiperfect Domination in Trees
Strong non split r-domination number of a graph
Transformations in hexangulations on the sphere
The nonidealness index of circulant matrices
Combinatorial Relaxation Bounds and Preprocessing for Berth Allocation Problems
Stochastic Survivable Network Design Problems
Some new results on the graph Γ 1 (R) over a ring R
The cut condition for robust network design
Hypergraphs with no odd cycle of given length
An Algorithm for k th Minimum Spanning Tree
An Algorithm for Multistage Stochastic Integer Programs
A combinatorial optimization problem arising from text classification
The Join of Graphs and Crossing Numbers
On mixed codes with covering radius 1 and minimum distance 2: (extended abstract)
Three classes of minimal circular-imperfect graphs
3rd International Conference on Variable Neighborhood Search (VNS'14)
Oriented Forests in Directed Graphs
{k}-domination for chordal graphs and related graph classes
Experiments with the "Oregon Trail Knapsack Problem"
Edge Partition of Toroidal Graphs into Forests in Linear Time
Stability of extremal hypergraphs with applications to an edge-coloring problem
Periodic parallelogram polyominoes
New VNP for automatic programming
Connectivity Augmentation of Graphs
Invariant sets under permutation, extremal graphs, and covering codes
Grundy number on P 4 -classes
Oriented vertex and arc colorings of partial 2-trees
Towards an Efficient Library for SAT: a Manifesto
Some medications of Ramsey numbers
Treewidth of planar graphs: connections with duality
Consecutive ones matrices for multi-dimensional orthogonal packing problems
Searching for Selection Algorithms
On the number of rational points of curves over finite fields
A 4-cycle and a 2-factor with two components of a graph satisfying the Chvátal-Erdös condition
A Boundary Class for the k-Path Partition Problem
A generalization of Chen's theorem on the Erdős-Turán conjecture
Dependent rational points on curves over finite fields - Lefschetz theorems and exponential sums
The Maximum Genus of a Graph with Given Diameter and Connectivity
Capacitated m Ring Star Problem under Diameter Constrained Reliability
Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT)
On Some Algorithmic Problems Regarding the Hairpin Completion
A New Measure for Gracefulness of Graphs
Antibandwidth of Complete k-Ary Trees
Bounds on the rank and kernel of perfect codes
New parameters for studying graceful properties of graphs
Minimizing the Number of Exceptional Edges in Cellular Manufacturing Problem
Traceability in Small Claw-Free Graphs
On encoding polynomials for strong algebraic manipulation detections codes
Embedding spanning subgraphs of small bandwidth
Perfect Codes and Balanced Generalized Weighing Matrices, II
Factorization as a SAT problem
Iterated Sumsets and Olson's Generalization of the Erdős-Ginzburg-Ziv Theorem
Numerical Study of Semidefinite Bounds for the k-cluster Problem
On two-part Sperner systems for regular posets (Extended Abstract)
A fast and elementary algorithm for digital plane recognition
Column Generation Based Approaches for Combined Routing and Scheduling
The lattice of strict completions of a poset
Large Scale Simulations of a Neural Network Model for the Graph Bisection Problem on Geometrically Connected Graphs
(Di)graph products, labelings and related results
Towards a problem of Ruskey and Savage on matching extendability
Ordinarization of Numerical Semigroups
Rainbow k-connection in Dense Graphs (Extended Abstract)
An Ore-type condition for arbitrarily vertex decomposable graphs
Denumerants of 3-numerical semigroups
Polyhedral Sets and Integer Rounding
On Extremal Additive I 4 Codes of Length 10 to 18
Intersecting a simple mixed integer set with a vertex packing set
An application of Combinatorics in Cryptography
The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs
Clique-perfectness of complements of line graphs
Combining Preorder and Postorder Resolution in a Satisfiability Solver
t-Balanced Cayley maps of dihedral groups
On Coxeter spectral classification of P-critical edge-bipartite graphs of Euclidean type A n
On the Fiedler value of large planar graphs (Extended abstract)
Randomized mechanisms for limited supply multi-item auctions
Estimating the relevance on Communication Lines Based on the Number of Edge Covers
Edge-magic Indices of (n, n - 1)-graphs
Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems
Near-perfect graphs with polyhedral N + (G)
Approximation of 3-Edge-Coloring of Cubic Graphs
Formulation and algorithms for the robust maximal covering location problem
Patches with minimal boundary length
Rainbow matchings and connectedness of coloured graphs
On maximal instantaneous codes
A Genetic Algorithm for a Green Vehicle Routing Problem
Towards a flow theory for the dichromatic number
Loose Hamiltonian cycles forced by (k - 2)-degree - approximate version
On the Hamiltonian cycle Decompositions of Complete 3-Uniform Hypergraphs
Discrete Point X-Rays of Convex Lattice Sets
On the X-rays of permutations
A Individually Marginalistic Value for Set Games on Matroids
Minimal families in terms of double-sided shadow in the Boolean cube layer
The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs
Extreme Weights in Steinhaus Triangles
Recourse problem of the 2-stage robust location transportation problem
Upper Bound for Failure Risk in Networks
Periodicity and Repetitions in Parameterized Strings
Behzad-Vizing conjecture and Cartesian product graphs
Discrete models and algorithms for packet scheduling in smart antennas
Drezner's Exact Method for the Continuous p-Centre Problem Revisited
On an arithmetic triangle of numbers arising from inverses of analytic functions
Notable trends concerning the synchronization of graphs and automata
A Tutte polynomial for non-orientable maps
Detecting an induced subdivision of K 4
Homomorphisms of Cayley graphs and Cycle Double Covers
A new occurrence of Catalan numbers: cap permutations
On the maximum number of cycles in outerplanar and series-parallel graphs
Algebraic connectivity on a subclass of caterpillars
Excluded-Minor Characterizations of Antimatroids arisen from Posets and Graph Searches
Fast generation of nanotube caps
Degree exponent polynomial of graphs obtained by some graph operations
Some results on the Wiener index of iterated line graphs
LD-graphs and global location-domination in bipartite graphs
A Ramp Model for Distributed Key Distribution Schemes
Nowhere-zero 5-flows
Hamilton cycles in 4-connected troidal triangulations
A Polyhedral Approach for Graph Coloring 1
Unsolved Problems on Distance in Graphs
Generating effective symmetry-breaking predicates for search problems
H-V-super magic decomposition of complete bipartite graphs
Using Gumbel Distribution to determine the distribution for maximum and minimum in the degree sequence
The structure of obstructions to treewidth and pathwidth
Hybrid Metaheuristic for Bicluster Editing Problem
On rainbow matchings in bipartite graphs
Distance Labelling Problems for Hypercubes and Hamming Graphs - A Survey
Lower Bounds for Pinning Lines by Balls (Extended Abstract)
A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints
Fulkerson's Conjecture and Loupekine snarks
Improved lower bounds on m r (2, 29)
Discrete optimization methods to determine trajectories for Dubins' vehicles
Strong and weak domination in graphs
Optimization of transition rules in a Bonus-Malus system
On Co-maximal Meet Signed Graphs of Commutative Rings
Two Models of Random Intersection Graphs and their Applications
Optimal Parallel Searching an Array for Certain Repetitions
An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems
Lattice walks in the octant with infinite associated groups
Optimal Edge Fault-Tolerant Bijective Embedding of a Complete Graph over a Cycle
On ( q 2 + q +1)(q2+q+1)-sets of class [1, m , n ] 2 [1, m, n]2 in PG(3, q )PG(3, q)
Coloring a set of touching strings
Modeling Earthquake Vulnerability of Highway Networks
On the number of geodesics of Petersen graph GP(n, 2)
Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs
Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs
On unitals in P G (2, q 2 )PG(2, q2) stabilized by a homology group
The lower domination parameters in inflated graphs
A robust P2P streaming architecture and its application to a high quality live-video service
The Complexity of Measuring Power in Generalized Opinion Leader Decision Models
Sparse asymmetric connectors in communication networks
SIMPLE MAX-CUT for unit interval graphs and graphs with few P 4 s
New advances about a conjecture on Helly circle graphs
Some results on graph parameters in weighted graphs
Diameter, minimum degree and hyperbolicity constant in graphs
The Independent Transversal Dombondage Number of a Graph
Minmax degree of graphs (Extended abstract)
Optimal main effect plans in blocks and related nested row-column designs
Chronological Rectangle Digraphs
Graceful Labeling of Balanced Stars of Paths
Computing the integrality gap of the asymmetric travelling salesman problem
The Graph Segmentation Problem
Packing arborescences in random digraphs
Grid Ramsey problem
0 - 1 Quadratic Knapsack Problem solved with VNS algorithm
An improved local search algorithm for 3-SAT
Reoptimization Gaps versus Model Errors in Online-Dispatching of Service Units for ADAC
Bipartite Graphs, Hamiltonicity and Z graphs
Minimizing Expected Attacking Cost in Networks
On the use of multiple sinks to extend the lifetime in connected wireless sensor networks
On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles
A New Facet Generating Procedure for the Stable Set Polytope
Finding stable flows in multi-agent networks under an equal-sharing policy
Exposing Metaheuristics as Web Services in Distributed Systems using OpenCF
About some Hadamard full propelinear (2t, 2, 2)-codes. Rank and Kernel
-consistent and -cycle compatible dot-line signed graphs
Monitoring maximal outerplanar graphs
Multiple hamiltonian covers
The 3-colored Ramsey number of odd cycles
A variable neighborhood search algorithm for the vehicle routing problem with multiple trips
A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow
On the Biobjective Adjacent Only Quadratic Spanning Tree Problem
2K 2 -Partition Problem
Variable neighborhood search algorithms for pickup and delivery problems with loading constraints
Decomposition of 8-regular graphs into paths of length 4