yusuke1997/dblp-id-title huggingface dataset:
Applying Algorithm Selection - a Case Study for the Generalised Assignment Problem
Solving the minimum labelling spanning tree problem using hybrid local search
On Extremal Graphs with Bounded Girth
Orthogonal Drawings Based On The Stratification Of Planar Graphs
Subset matching and edge coloring in bipartite graphs
Minimum Linear Arrangements
Recent Advances in Exact Crossing Minimization (Extended Abstract)
Treewidth: Computational Experiments
Nonlinear Optimization for the Recognition of Discrete Linear Objects
A binary block concatenated code based on two convolutional codes
Maximum values of Szeged index and edge-Szeged index of graphs
Fulleroids with Dihedral Symmetry
On a bi-level formulation to protect uncapacitated p-median systems with facility recovery time and frequent disruptions
Solutions of a problem of Ore on spanning trees and its generalization
Dantzig-Wolfe Reformulation for the Network Pricing Problem with Connected Toll Arcs
Performance Ratios for the Karmarkar-Karp Differencing Method
Exponentially many hypohamiltonian snarks
Labeling trees with a condition at distance two
On disjoint crossing families in geometric graphs
Sum coloring of distance and circulant graphs
Steinberg-like theorems for backbone colouring
A Random Graph Model of Mobile Wireless Networks
A classification of arc-locally semicomplete digraphs
Sums and differences along Hamiltonian cycles
Construction of 1-designs from group action
Applying Variable Neighborhood Search to the Single-machine Maximum Lateness Rescheduling Problem
On Sum of Powers of the Laplacian Eigenvalues of Power Graphs of Certain Finite Groups
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems
One-point extensions of generalized hexagons and octagons
Transversals of Longest Paths
On Longest Cycles in Essentially 4-connected Planar Graphs
(3, 1)*-choosability of planar graphs without adjacent short cycles
Complexity of determining the maximum infection time in the geodetic convexity
Clique Divergent Clockwork Graphs and Partial Orders
Graceful digraphs and complete mappings
Shortest paths through two-tone pairs
WDM Fiber Replacement Scheduling
Solution to the Mean King's Problem in Prime Power Dimensions Using Discrete Tomography
P-antiregular graphs
1-perfectly orientable K 4 -minor-free and outerplanar graphs
On cliques and bicliques
Strong reducibility of powers of paths and powers of cycles on Impartial Solitaire Clobber
S-Boxes from Binary Quasi-Cyclic Codes
Generalized trees related with tree metrics
Discrete unbounded sets in a finite dimensional space and beyond
Scheduling preventive railway maintenance activities with resource constraints
On the Existence of Critical Clique-Helly Graphs
A Computational Study of Conflict Graphs and Aggressive Cut Separation in Integer Programming
Coloring the edges of a random graph without a monochromatic giant component
The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks
Detecting flows congesting a target network link
Improved compact formulations for metric and cut polyhedra
Solving the Traveling Circus Problem by Branch & Cut
Nonisomorphic configurations n k
The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut
A note on the maximum number of triangles in a C 5 -free graph
Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and covering
A Kuratowski Theorem for some Pseudosurfaces
Even pairs in square-free Berge graphs
New approach to Petersen coloring
Directed Covering with Block Size 5 and Index Odd
Calculating Exact Transitive Closure for a Normalized Affine Integer Tuple Relation
Chip-Firing and Riemann-Roch Theory for Directed Graphs
A New Graph Construction of Unbounded Clique-width
Recovery of disrupted airline operations using k-Maximum Matching in graphs
Scheduling with Duplication on m Processors with Small Communication Delays
Short cycles in oriented graphs
On extremal bipartite graphs with high girth
Discrete Tomography of Mathematcal Quasicrystals: A Primer
Non-projective embeddings in the Grassmann variety
VNS based heuristic for solving the Unit Commitment problem
On the Moore-Penrose inverse of distance-regular graphs
Hamiltonian cycles in I-graphs
Line Signed Graph of a Signed Total Graph
Shortcut sets for plane Euclidean networks (Extended abstract)
Maximum Cuts in Edge-colored Graphs
Combinatorial Recurrences and Linear Difference Equations
The Grad of a Graph and Classes with Bounded Expansion
Read-Once Functions Revisited and the Readability Number of a Boolean Function
Ear decompositions of join covered graphs
Decomposing tournaments into paths
Benders Decomposition for a Location-Design Problem in Green Wireless Local Area Networks
Reconstruction of Fourier Sparse Signals over Elementary Abelian Groups
On S-Magic Graphs
Strength of facets for the set covering and set packing polyhedra on circulant matrices
Subgraph Matching with Semidefinite Programming
Stochastic geometric programming with joint probabilistic constraints
Two aspects of the pallet loading problem
Self-orthogonal codes constructed from orbit matrices of 2-designs and quotient matrices of divisible designs
Semiarcs with long secants
Estimating with randomized encoding the joint empirical distribution in a correlated source
Characterizations of Graphs with Stretch Number less than 2
On Graphs with Induced Matching Number Almost Equal to Matching Number
Intersection of Longest Paths in Graph Classes
On projective spaces PG(r, q) with r>=4
Column Generation for Extended Formulations
Variable Neighborhood Search for Vehicle Routing Problem with Multiple Time Windows
Divisibility conditions in almost Moore digraphs with selfrepeats
Satisfaction and Power in Unanimous Majority Influence Decision Models
On the Monotonicity of Process Number
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles
Betweenness Centrality in Cartesian Product of Graphs
The minimum number of triangles in graphs of given order and size
On a particular case of the multi-criteria unconstrained optimization problem
Reconstruction of pixel-based and geometric objects by discrete tomography. Simulation and physical experiments
Decomposition of complete bipartite graphs into open trails
Remarks on Distance Distributions for Graphs Modeling Computer Networks
Self-sufficient sets in smartgrids
Discrepancy of Centered Arithmetic Progressions in Zp (Extended Abstract)
Preface: Volume 9
Polytopal complexes: maps, chain complexes and... necklaces
Reliability-Based Soft-Decision Decoding with Iterative Information Set Reduction
Linear Models and Computational Experiments for the Quadratic TSP
A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem
On the reconstruction of graph invariants
On strongly regular graphs with µ >= 2
New exponential neighbourhood for polynomially solvable TSPs
Scheduling flexible flowshops with unit-time operations and minimum time delays
A branch and price approach for the Split Pickup and Split Delivery VRP
Enumerative Combinatorics and Shannon's Theory of Discrete Noiseless Channels
Ramsey classes with forbidden homomorphisms and a closure
Rainbow matchings and algebras of sets
Reduced graphs for min-cut/max-flow approaches in image segmentation
Tree partitioning via vertex deletion
Isometric embeddings of subdivided complete graphs in the hypercube
Clique width of Partner limited graphs
Perfection, Imperfection, and Graph Entropy
Combinatorics: Applications to Experimental Designs and Sample Surveys
Limits of some combinatorial problems
A Cryptographic Code Based on Digraphs
A note on Distance Magic and Distance antimagic graphs
On the orthogonal product of simplices and products of truncated Boolean lattices
On an extension of distance-hereditary graphs
General Delay Budgeting on Directed Acyclic Graphs with Applications in CAD
The Growth Rate of High-Dimensional Tree Polycubes
Decomposition of consecutive-1 matrices and applications
Reformulated Reciprocal Degree Distance of Transformation Graph
Partitioning a graph into minimum gap components
Minor-minimal non-projective planar graphs with an internal 3-separation
Binary Images of Cyclic codes over I 4
P k+1 -Decompositions of Eulerian Graphs: Complexity and Some Solvable Cases
Resolving Ambiguities in Reconstructed Grain Maps using Discrete Tomography
Super Edge - Magic Strength of Fire Crackers, Banana Trees and Unicyclic Graphs
Query-based Information Gathering in Intelligent Transportation Systems
Chromatic Numbers and Cycle Parities of Quadrangulations on Nonorientable Closed Surfaces
Studying Properties of Graphs through their k-vertex Subsets: I IIkappa-complete Graphs and IIkappa-completion numbers
Size of Graphs with High Girth
Matching Connectivity: On the Structure of Graphs with Perfect Matchings
Solving Over-Constrained Satellite Remote-Sensing Scheduling Problems
Some Results on a Paint Shop Problem for Words
The Fortress Problem in Terms of the Number of Reflex and Convex Vertices. A 3D objects scanning application
Efficient MIP formulation for optimal 1-for-N diversity coding
A new Mathematical Programming Model for the Green Vehicle Routing Problem
Self-orthogonal decompositions of graphs into matchings
Feasibility of the Mixed Postman Problem with Restrictions on the Edges
Random Generation of Combinatorial Structures using Context-Fee Grammars
Fair representation in dimatroids
Polynomial invariants for binary linear codes
Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs
Algorithms for the degree-constrained minimum spanning tree problem
A polyhedral approach to locating-dominating sets in graphs
A variant of the McKay-Miller-Širáň construction for mixed graphs
On the first unknown value of the function g(v)
A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows
A general critical condition for the emergence of a giant component in random graphs with given degrees
Generating good starting solutions for the p-median problem in the plane
On the local density problem for graphs of given odd-girth
A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree
An efficient local search method for random 3-satisfiability
Simultaneous Resolvability in Graph Families
Fractional covering by cuts
Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time
Subdivision Number of Graphs and Falsity of a conjecture
Quantum Identification Protocol with Technologically Bounded Parties
European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009)
Homomorphisms of Strongly Regular Graphs
On the ascending subgraph decomposition problem for bipartite graphs
Independent spanning cycle-rooted trees in the cartesian product of digraphs
Eliminating redundant solutions of some symmetric combinatorial integer programs
Edge Multiplicity and Other Trace Functions
Counting triangulations of balanced subdivisions of convex polygons
On determining the imperfection ratio
Rank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract)
Acyclic edge-colouring of planar graphs. Extended abstract
Lower Bounds for Divergence in Central Limit Theorem
Characteristic polynomials of production matrices for geometric graphs
Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
Octants are Cover Decomposable
Design of fiber cable tree FTTH networks
Benders Decomposition of the Passive Optical Network Design Problem
Hamilton Cycles and Degree Sequences
Discrete Reconstruction Techniques
Exploiting the real power of unit propagation lookahead
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
Pairwise intersecting homothets of a convex body
The Gain-Loss Model: Bias of the Parameter Estimates
On balanced signed graphs and consistent marked graphs
On the intersection of two subgeometries of PG(n, q)
Asymptotic enumeration of cographs
Filling of a given boundary by p-gons and related problems
Embedding spanning bounded degree subgraphs in randomly perturbed graphs
Triangle-free graphs without forbidden subgraphs
Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings
Coding for a Multiple Access OR Channel: a Survey
The Shared Broadcast Tree Problem and MST
Construction of Mixed Covering Arrays Using a Combination of Simulated Annealing and Variable Neighborhood Search
Six-Critical Graphs on the Klein Bottle
Integer programming models for maximizing parallel transmissions in wireless networks
Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution
Minimum Discrepancy Estimation in Probabilistic Knowledge Structures
Gracefulness of vertex duplicated complete bipartite graph for static and incremental frequency allocation
On the Longest Paths and the Diameter in Random Apollonian Networks
The track formulation for the Train Dispatching problem
Formulations for the Minimum 2-Connected Dominating Set Problem
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
Dejean's conjecture and letter frequency
On double bound graphs and forbidden subposets
H-E-super magic decomposition of complete bipartite graphs
The Generalized Minimum Spanning Tree: Polyhedra and Branch-and-Cut
On the thinnest coverings of spheres and ellipsoids with balls in Hamming and Euclidean spaces
Bijective combinatorics of positive braids
Constructive Upper Bounds for Intersecting Set Systems
Discriminating codes in bipartite graphs
Reconstructing Digraphs from Partial Dadecks
Radio number of trees
Potential Theory on Finite Networks
On the approximability of two capacitated vehicle routing problems
VNS as an upper bound for an exact method to solve a class of on-demand transit transportation systems
A Decomposition Theorem for Chordal Graphs and its Applications
Dushnik-Miller dimension of contact systems of d-dimensional boxes
On Minimum Reload Cost Cycle Cover
The Online Prize-Collecting Facility Location Problem
Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming
Triangles in random cubic planar graphs
Partial Satisfaction of k-Satisfiable Formulas
Linear number of diagonal flips in triangulations on surfaces
On the use of autarkies for satisfiability decision
On the Hardness of Equal Shortest Path Routing
Antibandwidth and Cyclic Antibandwidth of Hamming Graphs
Pebble Games and Cospectral Graphs
Generalizations of Heilbronn's Triangle Problem
A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids
A GVNS Algorithm for Solving the Multi-Depot Vehicle Routing Problem
Rainbow numbers for certain graphs
A Branch-and-price algorithm for a Vehicle Routing Problem with Cross-Docking
Bounds for Optimal Coverings
A hybrid VND method for the split delivery vehicle routing problem
Simple expressions of the Buratti-Del Fra dual hyperoval and the deformation of the Veronesean dual hyperoval
No Cycling in the Graphs!
Conceptual Models for Combined Planning and Scheduling
Geometric variants of Hall's Theorem through Sperner's Lemma
Unifying the representation of symmetric crossing families and weakly partitive families
k -Adaptive Routing for the Robust Network Loading Problem
Percolation on a k-ary Tree
Vertices of Degree k in Random Unlabeled Trees
Competitive Algorithms for Cottage Rental
A Multilevel Genetic Algorithm for the Traveling Salesman Problem
4-colorability of P 6 -free graphs
On single-path network routing subject to max-min fair flow allocation
Optimizing Toll Enforcement in Transportation Networks: a Game-Theoretic Approach
The Multidimensional Manhattan Network
Prime Labelings
Structure and Interpretation of Dual-Feasible Functions
Team Orienteering Problem with Decreasing Profits
A new infinite family of minimal non-orientable matroids of rank 3 with 3n elements
Performance Analysis of Algorithms for the Steiner Problem in Directed Networks
Encoding Bigraphical Reactive Systems into Graph Transformation Systems
Coloring circle graphs
Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem
Pancyclic orderings of in-tournaments
VNS-based heuristic with an exponential neighborhood for the server load balancing problem
Equitable colorings of non-uniform simple hypergraphs
Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a I -approximation for finding maximum planar induced subgraphs
On Equitable Coloring of Central Graphs and Total Graphs
A Game-theoretic Algorithm for Non-linear Single-Path Routing Problems
Maintenance on the Railway Network: Disruptions and re-scheduling
Size Ramsey numbers for some regular graphs
Flow-Critical Graphs
Bipartite-Perfect Graphs
On tight blocking set in minimum coverings
Domination on Circulant Graphs with two chord length
Linear Recursive MDS-Codes and Asturian codes
Construction of self-orthogonal linear codes
Geometrically Uniform n-shot Subspace Codes
Testing of Hypothesis and Identification
Hamiltonicity and pancyclicity of generalized prisms
Reconstruction of binary matrices under adjacency constraints
A simple approach for lower-bounding the distortion in any Hyperbolic embedding
Complete Multipartite Graphs and their Null Set
Characterization of Graphs G for which I
The Fifth and Sixth Coefficients of the Characteristic Polynomial of a Graph
Routing Concurrent Video Signals over SDH Networks
Algorithms to Approximately Count and Sample Conforming Colorings of Graphs
Recognizing more random unsatisfiable 3-SAT instances efficiently
Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals
A Kraft-type inequality for d-delay binary search codes
On spectra of weighted graphs of order ≤5
Block transitivity and degree matrices: (Extended abstract)
An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid
Disjunctive combinatorial branch in a subgradient tree algorithm for the DCMST problem with VNS-Lagrangian bounds
Goppa-like bounds for the generalized Feng-Rao distances
A hierarchical network formation model
Forbidden inclusion patterns in families of subsets
Ramsey Numbers of Squares of Paths
A bicriteria flow-shop scheduling problem with two serial batching machines
Quasirandom Rumor Spreading on Expanders
Bandwidth, treewidth, separators, expansion, and universality
(k, c) - coloring via Column Generation
On unretractive graphs
Bicolored matchings in some classes of graphs
Reconstruction of factor structures using discrete tomography method
2K 2 vertex-set partition into nonempty parts
Superimposed Codes in I n Obtained from Spherical Codes
PaSAT - Parallel SAT-Checking with Lemma Exchange: Implementation and Applications
A matheuristic approach for solving a home health care problem
Nakajima's remark on Henn's proof
Some families of arbitrarily vertex decomposable graphs
Influence Digraphs Induced by Time-Stamped Graphs (Extended Abstract)
Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2
Convex Recoloring of Paths
Extremal graph theory and finite forcibility
ν-Tamari lattices via subword complexes
Graph decompositions for cartesian products
(p, k)-coloring problems in line graphs
Budgeted Colored Matching Problems
Bounding minimum distances of cyclic codes using algebraic geometry
Solving Problems for Maximal Reducible Flowgraphs
A branch&cut algorithm for the maximum common edge subgraph problem
On unit interval graphs with integer endpoints
Finding Paths between Graph Colourings: Computational Complexity and Possible Distances
On the applications of Extremal Graph Theory to Coding Theory and Cryptography
Dimension and Height for Posets with Planar Cover Graphs
On the Genus of a Subfield of a Field
New bounds for the maximum cut problem
On Edge-Graceful Regular Graphs with Particular 3-Factors
Changing and Unchanging in m-Eternal Total Domination in Graphs
Anagram-free colorings of graphs
Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling
Packings and 2-packings of A-paths
Neighborhood Communications in Networks
Polynomial solvability of Mader's edge-disjoint paths problem
A modified variable neighborhood search hybridized with genetic algorithm for vehicle routing problems with cross-docking
On downward half Cauchy sequences
Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs
The stable set polytope of claw-free graphs with large stability number
The chromatic number of random lifts of K 5 e
AutoGraphiX: An Automated System for Finding Conjectures in Graph Theory
Nash Equilibria Conditions for Cyclic Games with p Players
Stabbing convex subdivisions with k -flats
Determining the flow numbers of signed eulerian graphs
Graphs with unique dominating sets
Covering Arrays via Set Covers
Iterated Greedy with Random Variable Neighborhood Descent for Scheduling Jobs on Parallel Machines with Deterioration Effect
On the Location of Roots of Graph Polynomials
Equiangular lines and subspaces in Euclidean spaces
Greedy defining sets in graphs and Latin squares
Dimension and codimension of simple games
On the Complexity of the P 3 -Hull Number of the Cartesian Product of Graphs
The Connectivity of addition Cayley graphs
A hybrid heuristic for a stochastic production-inventory-routing problem
Partial Colorings of Unimodular Hypergraphs
On t-fold blocking sets in affine spaces and the sharpness of Bruen's bound
Standard Monomials and Extremal Vector Systems
Algorithms for uniform centered partitions of trees
Coloring Fuzzy Circular Interval Graphs
Cyclic colliding permutations
A Survey of Irregularity Strength
Composition of graphs and the triangle free subgraph polytope
On the Superconnectivity in graphs with odd girth g and even girth h
Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
Bilateral Orientations and Domination
Update on the Extension of Good Linear Codes
Tomography on Finite Graphs
Characterisation of symmetries of unlabelled triangulations
Efficient Compression of Distributed Information in Estimation Fusion
The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation
Piece Selection Algorithm for Layered Video Streaming in P2P Networks
Independent Production of Non Hamiltonian Graphs
On the hereditary (p, q)-Helly property of hypergraphs, cliques, and bicliques
A Mathematical Model for the Optimization of the Airport Check-In Service Problem
New Multi-Objective Approach for the Home Care Service Problem Based on Scheduling Algorithms and Variable Neighborhood Descent
A construction of loops by means of regular permutation sets
Bijections for walks ending on an axis, using open arc diagrams
An Approximation Algorithm for the p -Hub Median Problem
Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized
Branch-and-Price for a European variant of the Railroad Blocking Problem
The Tutte polynomial characterizes simple outerplanar graphs
VNS variants for the Max-Mean Dispersion Problem
Kings Domination on a Torus
On Perfect Cayley Graphs
Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
A note on symplectic polar spaces over non-perfect fields of characteristic 2
A Hybrid Heuristic based on Iterated Local Search for Multivehicle Inventory Routing Problem
Discrete optimal control problems and dynamic games with p players
Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs
A C.A.S. treatment of optimal-diameter double-loop digraphs families
Additive Approximation for Layer Minimization of Manhattan Switchbox Routing
Dynamic trees in exterior-point Simplex-type algorithms for network flow problems
Some contributions to the Frobenius' Problem
Graphs preserving total distance upon vertex removal
On the minimum degree and the proper connection number of graphs
A Graph Partitioning Scheme and Applications to Fault Tolerant Computing
Intelligent variable neighbourhood search for the minimum labelling spanning tree problem
Enumeration of Super-simple Cyclic Block Designs of Small Order