yusuke1997/dblp-id-title huggingface dataset:
A MILP formulation for a tire curing scheduling problem
Coding Properties of Breadth-First Search Orderings
Linear time and space algorithms for discrete paths on the 1-uniform regular lattices of Z 2
Unit Interval Graphs: A Story with Open Ends
Full Orientability of Graphs
On partitions of a rectangle into rectangles with restricted number of cross sections
On a Frankl-Rödl theorem and its geometric corollaries
On the Convex Hull of Huffman Trees
Size Ramsey Numbers Involving Large Stars
Local cutpoints and iterated clique graphs
Covering oriented points in the plane with orthogonal polygons is NP-complete
Graph Operations Preserving W 2 -Property
Characterising claw-free t-perfect graphs
Maximum colorful independent sets in vertex-colored graphs
The number of convergent graphs under the biclique operator with no twin vertices is finite
Approximating Subdense Instances of Covering Problems
On the Chvátal-rank of Antiwebs
Geometric quadrangulations of a polygon
A counting lemma for sparse pseudorandom hypergraphs
Chronological Orderings of Interval Digraph
A Multi-objective Variable Neighborhood Search algorithm for solving the Hybrid Flow Shop Problem
Minimal Polynomials of the Modified de Bruijn Sequences
On completely regular binary codes and t-designs *
Generalized symmetry of graphs
On the Rationale of the Transformity Method
Some structural, metric and convex properties on the boundary of a graph
Small clique and large chromatic number
On path decompositions of 2k-regular graphs
Energy-aware survivable networks
Hyper-Hamiltonicity in graphs: some sufficient conditions
Autoparatopism stabilized colouring games on rook's graphs
On the number of solutions of binomial Thue inequalities
AG codes, t -designs and partition sets
ILP modelling and joint optimization of anycast and unicast traffic in survivable elastic optical networks
International Network Optimization Conference, Tenerife 2013
On the Online Min-Wait Relocation Problem
LDPC codes: a group algebra formulation
Rotational Cayley Graphs on Transposition Generated Groups
Chromatic Edge Strength of Some Multigraphs
Scheduling on parallel machines considering job-machine dependency constraints
Trajectory clustering of points in R
Minimum Size Tree-decompositions
Planes and Processes
Sequences with good correlations and some open problems
Graceful and Cordial Labeling Of Subdivision Of Graphs
Medians in LLD Meet Semilattices and the Case of Orders
Introducing Directed Tree Width
Vertex Pancyclic Graphs
IP modeling of the survivable hop constrained connected facility location problem
More Progress on Tough Graphs - The Y2K Report
Polynomial approximation algorithms for solving resource-constrained project scheduling problem
Extremal problems under dimension constraints
Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility
The Junta Method in Extremal Hypergraph Theory and Chvátal's Conjecture
Uniform Sampling of Directed and Undirected Graphs Conditional on Vertex Connectivity
Computing an irregularity strength of selected graphs
GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery
Minimum Monopoly in Regular and Tree Graphs
Matchings in 3-uniform hypergraphs of large minimum vertex degree
Selfish Square Packing
K 6 and icosahedron minors in 5-connected projective planar graphs
An upper bound on the size of separated matchings
Compact Models for Critical Node Detection in Telecommunication Networks
On Efficient Domination for Some Classes of H -Free Chordal Graphs
Extending the Reach of SAT with Many-Valued Logics
A lattice-based McEliece scheme for encryption and signature
A simulated annealing for reconstructing hv-convex binary matrices
Stability in geodesics for memoryless binary long-lived consensus
Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions
Several Classes of (2 m - 1, w, 2) Optical Orthogonal Codes
Assigning surgery cases to operating rooms: A VNS approach for leveling ward beds occupancies
Non loop graphs with induced cycles
Finding Triangles in Restricted Classes of Graphs
The Complexity of SIMPLE MAX-CUT on Comparability Graphs
Two 3D symmetrical thinning algorithms based on P-simple points
Laplacian Eigenvalues and multisections
Partitioning 3-coloured complete graphs into three monochromatic paths
Roman domination in subgraphs of grids
Upper Secure Domination Number of a Graph
Discrete tomography for reconstruction from limited view angles in non-destructive testing
The Stochastic Guaranteed Service Model with Recourse for Multi-Echelon Warehouse Management
Extended Gallai's Theorem
A simple removal lemma for large nearly-intersecting families
Intersection graphs of cyclic subgroups of groups
Least Common Multiple of a Cycle and a Star
Some Inverse Traveling Salesman Problems
An Introduction to Health Services Research
Addressing the Petersen graph
Computing an Evolutionary Ordering is Hard
A Convex Polytope and an Antimatroid for any Given, Finite Group
On Sorting by 3-Bounded Transpositions
On the Eigenvalues of a Graph
A Column Generation Model for a Scheduling Problem with Maintenance Constraints
Some results on edge pair sum labeling
From Tetris to polyominoes generation
Quasirandomness in hypergraphs
A comparison of ordinal analysis techniques in medical resource usage research
Comparison on the spectral radii of weighted digraphs that differ in a certain subdigraph
Local resilience of spanning subgraphs in sparse random graphs
Dominating Broadcast Labeling in Cartesian Products of Graphs
On characterizing the extreme points of the generalized transitive tournament polytope
Enumeration of cubic multigraphs on orientable surfaces
Improving Convergence Rates of a Class of Algorithms
An approximate blow-up lemma for sparse pseudorandom graphs
Some Topological Methods in Graph Coloring Theory
DIMAP Workshop on Algorithmic Graph Theory
Multi-index axial assignment problem on single-cyclic permutations
Structural Results for General Partition, Equistable and Triangle graphs
Distance Labeling for Permutation Graphs
The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems
Lower Bounds for the Minimum Linear Arrangement of a Graph
Some advances on Lovász-Schrijver N + (⋅) relaxations of the fractional stable set polytope
On triple systems, in particular those with 13 elements
Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints
Combinatorial batch codes: Extremal problems under Hall-type conditions
The Unreasonable Effectiveness of Alternation-Based Satisfiability Algorithms
Polyhedral Embeddings of Cayley Graphs
Edge Monitoring Problem on Interval Graphs
The structure and unlabelled enumeration of toroidal graphs with no K 3, 3 's
2-InterConnected Facility Location: Specification, Complexity, and Exact Solutions
The b-chromatic number of powers of hypercube
Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs
A New Neighborhood for the QAP
On a packet scheduling problem for smart antennas and polyhedra defined by circular-ones matrices
Discrete tomography with a very few views, using Gibbs priors and a Marginal Posterior Mode approach
Generalizing the Wolf-Goat-Cabbage Problem
Generating all the cubic graphs that have a 6-cycle double cover
A computational study for the p-median Problem
The Clique Operator, Set Families, and Their Properties
A Linear Programming Relaxation for Binary Tomography with Smoothness Priors
Speculative data prefetching for branching structures in dataflow programms
Outerplanar Obstructions for Matroid Pathwidth
Tutte's 5-flow conjecture for highly cyclically connected cubic graphs
Two Posets of Noncrossing Set Partitions
Earliest Arrival Flows in Networks with Multiple Sinks
Sparse Semi-Magic Squares and Magic Labelings of Directed Graphs
On Extensions, Linear Extensions, Upsets and Downsets of Ordered Sets (Extended Abstract)
The Complexity of the Matching-cut Problem for Various Graph Classes
The bi-join decomposition
Crossing graphs of fiber-complemented graphs
The t-improper chromatic number of random graphs
Some results on caps and codes related to orthogonal Grassmannians - a preview
Connected Graph Searching in Outerplanar Graphs
A Generalization of Hadamard Matrices
Preface: Volume 11
The Proper Interval Colored Graph problem for caterpillar trees: (Extended Abstract)
Making a tournament k-arc-strong by reversing arcs
On some results concerning generalized arithmetic triangles
Edge Coloring of Split Graphs
New family of small regular graphs of girth 5
Totally Multicoloured Cycles
Relative Length of Longest Path and Longest Cycle
The graph distance game and some graph operations
On containment graphs of paths in a tree
On the Pebbling Threshold Spectrum
Cutting-planes for weakly-coupled 0/1 second order cone programs
Graph-indexed random walks on pseudotrees
On Designs with Pencilwise Orthogonality and Balance
Bijective counting of plane bipolar orientations
On pseudorandom sequences and their application
A possible analogue of ρ-labellings for 3-uniform hypergraphs
Squares of Low Clique Number
VLSI Routing in Polynomial Time
Iterated Clique Graphs and Contractibility
Some new results on domination roots of a graph
An example of integrating constraint programming and mathematical programming
Empty triangles in complete topological graphs
On subgraphs of Cartesian product graphs and S-primeness
Multiway cut and integer flow problems in trees
Detailed Wordlength Pattern of Regular Fractional Factorial Split-Plot Designs in Terms of Complementary Sets
An Erdös-Stone Type Conjecture for Graphic Sequences
Exact Algorithms for the Imbalanced Time Minimizing Assignment Problem
Add/Drop Procedures for the Capacitated Plant Location Problem
Gallai-type theorems in domination and strong domination parameters
Algorithms for 3PC(., .)-free Berge graphs
On the Problem of Erdos and Hajnal in the Case of List Colorings
Network Interdiction through Length-Bounded Critical Disruption Paths: a Bi-Objective Approach
Heuristics for the Minimum Broadcast Time
Measurable sets with excluded distances
A polynomial formulation for the stochastic maximum weight forest problem
On Interference Graphs
Loops, regular permutation sets and graph colourings
Algorithms, pseudo-codes, implementations - some reflections on interdependencies and potential implications
Intersection Graphs of Orthodox Paths in Trees
The Reduced Prüfer Code for Rooted Labelled k-Trees
Chip-Firing, Antimatroids, and Polyhedra
Algorithms for finding minimum fundamental cycle bases in graphs
Isometric embedding of subdivided Connected graphs in the hypercube
Coloring Planar Toeplitz Graphs
GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem
Locally finite graphs and embeddings
The caterpillar-packing polytope
Subdivision of the hierarchy of H-colorable graph classes by circulant graphs
On perfect binary codes
On the Chromatic Numbers of I and I with Intervals of Forbidden Distances
Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable
Colourings of graphs by labellings
Monotonicity and inert fugitive search games
A Note on Algebraic Expressions of Rhomboidal Labeled Graphs
Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs
A note on permutation regularity
Large families of pseudorandom sequences of k symbols and their complexity, Part II
Third case of the Cyclic Coloring Conjecture
Direct Reading Algorithm for Hierarchical Clustering
Edge a -Zagreb Indices and its Coindices of Transformation Graphs
Totally Multicolored diamonds
A polyhedral study of the single-item lot-sizing problem with continuous start-up costs
A heuristic approach to project staffing
On graphs with a single large Laplacian eigenvalue
Compatible Geometric Matchings
A branch-and-cut approach to the repetition-free longest common subsequence problem
Search for a moving target in a graph
Graphs Having (2 mod d)-Cycles
Information Evaluation Of Chemical Structures By Modeling Arithmetic Graphs
Using SPQR-trees to speed up algorithms based on 2-cutset decompositions
A Neighborhood Exploration Approach with Multi-start for Extend Generalized Block-modeling
W 2 -graphs and shedding vertices
Spanning galaxies in digraphs
Simultaneous Disjoint Routing in Regular Graphs
Fraternal Augmentations of graphs, Coloration and Minors
Constructing Cospectral Digraphs with Arbitrary Centers
Rotation Symmetric Boolean Functions -; Count and Cryptographic Properties
On Generating Triangle-Free Graphs
A note on random k-dimensional posets
On induced acyclic subgraphs in sparse random digraphs
Auto-Walksat: A Self-Tuning Implementation of Walksat
More on orbital matrices
On some new 2-(56, 12, 3) designs
Cayley partitionable graphs
Faster algorithms for feedback vertex set
New parallelisms of PG(3, 4)
Quantum information transfer from one system to another one
Recognizing Recursive Circulant Graphs (Extended Abstract)
Skill map based knowledge structures: some considerations about their identifiability
A variable neighborhood descent approach for the two-dimensional bin packing problem
Green Vehicle Routing and Scheduling Problem with Split Delivery
Excluding clocks
Colouring squares of claw-free graphs
Symbolic Data Analysis: A Mathematical Framework and Tool for Data Mining
Mac Williams identities for linear codes as Riemann-Roch conditions
Some recent results on list coloring
Completion and decomposition of hypergraphs into dominating sets of graphs
On a certain class of nonideal clutters
On Inverse Chromatic Number problems (Extended abstract)
Linear time recognition of Weak bisplit graphs
Three coloring planar graphs without cycles of length from 4 to 6 or seven cycles with close triangles
The Gracefulness of the Join of Graphs
A Memetic Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
Homological connectedness of random hypergraphs
Nash Equilibria in a Multiple Stage Inspection Game
Radio k-Labelings for Cartesian Products of Graphs
Families with no matchings of size s
Enumerating Polyominoes with Fixed Perimeter Defect
Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond
Constructions of 1-Uniform dcsl graphs using Well-graded families of sets
A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
On identification
Perturbations on bidegreed graphs minimizing the spectral radius
Galois lattices and some symbolic data analysis algorithms
Some new (n, r)-arcs in PG(2, 31)
Discrete Fuzzy Matroids
Metamorphosis of simple twofold triple systems into twofold ( K 4 - e )(K4-e)-designs
Production matrices for geometric graphs
An Asymptotic Scheme for Analysis of Expectations of Plane Partition Statistics
Detection of Lines by Combinatorial Optimization
Consensus robustness against inner delays
On the geometry of certain periodic non-homogeneous Horadam sequences
Two Dimensional Strip Packing with Unloading Constraints
Binary 3D-Matrices Under the Microscope: A Tomographical Problem
Game Chromatic Number of Direct Product of Some Families of Graphs
New results on production matrices for geometric graphs
Modularity in several random graph models
Tree based heuristics for the preemptive asymmetric stacker crane problem
Extremities and orderings defined by generalized graph search algorithms
Boundary distortion in dynamical systems and in image analysis
Latin-American Conference on Combinatorics, Graphs and Applications: Santiago, CHILE August 16-20, 2004
Digraph representation by its path matrix The particular case of the bipartite graphs
Hamiltonian cycles of certain kinds of graphs satisfying Dirac condition
Time dependent multiobjective best path for multimodal urban routing
Colength of *-Polynomial Identities of Simple *-Algebras
On Sufficient Conditions for the RNIEP and their Margins of Realizability
The Power Model of Fitts' Law Does Not Encompass the Logarithmic Model
Structure of wheel-trees with colourings and domination numbers
Splitting Operation and Connectedness in Binary Matroids
About a class of Hadamard propelinear codes
Hull number: P 5 -free graphs and reduction rules
Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm
On non-traceable, non-hypotraceable, arachnoid graphs
The Capacitated Budgeted Minimum Cost Flow Problem with Unit Upgrading Costs
Transfinite Ramsey Numbers
A Priori and A Posteriori Aggregation Procedures to Reduce Model Size in MIP Mine Planning Models
Squares of Intersection Graphs and Induced Matchings
An Enumerative Algorithm for #2SAT
On the number of r-transitive orientations of G(n, p)
Graphs having distance-n domination number half their order
The incidentor coloring of multigraphs and its application in data networks
Operator Decomposition of Graphs and the Reconstruction Conjecture
Perfect codes in Cartesian products of hypercube and multidimensional grid
On Schur's conjecture
Formal Concept Analysis: Tutorial on formal concept analysis
Hadamard 2-(47, 23, 11) Designs havingFrob 55 as an Automorphism Group
Heavy cycles in k-connected weighted graphs
Controlled Randomized Rounding
Graphs with small hyperbolicity constant
Uniform Polynomial Dichotomy for Linear Discrete-time Systems
On the Convexity of Paths of Length Two in Undirected Graphs
Stable marriages with restricted pairs
Near-Optimal Solutions to Two-Dimensional Bin Packing With 90 Degree Rotations
A general variable neighborhood search for solving the uncapacitated r-allocation p-hub maximal covering problem
Total Edge Irregularity Strength of Disjoint Union of Wheel Graphs
Geometric realization of a triangulation on the projective plane with one face removed
Integral point sets over I
A planning and routing model for patient transportation in health care
Two New Classes of Hamiltonian Graphs: (Extended Abstract)
On Some Graph Operations and Related Applications
Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang Conjecture
The Second Minimum of the Irregularity of Graphs
On Finite Maximal Antichains in the Homomorphism Order
Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs
On Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract)
Discrete tomography in four directions
Partitions of Graphs into Cographs
Minimum embedding of path designs into kite systems
On the Characterization of (3 mod 5) Arcs
Obtaining reliability values from nonparametric receiver: the "optimal" parameter choice
Shortest Path Problem variants for the Hydro Unit Commitment Problem
Partial Complement of a Graph
Globally bounded local edge colourings of hypergraphs
ALEKS: An application of knowledge space theory: Tutorial on knowledge spaces
A post-optimization method to route scheduled lightpath demands with multiplicity
Panchromatic 3-coloring of a random hypergraph
Stochastic Quadratic Knapsack with Recourse
A combinatorial construction of an M 12 -invariant code
Inapproximability of the lid-chromatic number
Calculating the extremal number ex(v;{C 3 , C 4 , ..., C n })
The order of the largest complete minor in a random graph
On the Limitations of Graph Invariants Inspired by Quantum Walks
A Differential Evolution Algorithm for the Winner Determination Problem in Combinatorial Auctions
On bags and bugs
Coxeter groups through the looking glass: Mirrors and Convexity
Ramsey for complete graphs with a dropped edge or a triangle
MPQ-trees for orthogonal packing problem
On Ramsey Type Problems in Combinatorial Geometry
Bounds for the sum choice number
Square Roots of Minor Closed Graph Classes
Partition functions from orthogonal and symplectic group invariants
Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs
Surmise relations between tests: Preliminary results of the mathematical modeling
Detecting induced subgraphs
Splitting a Giant Tour using Integer Linear Programming
2-distance coloring of sparse graphs
The maximum sum and product of sizes of cross-intersecting families
Preferential Arrangement Superpatterns
An algorithm to Cyclic Path Covering Number
Decompositions into generalized Petersen graphs via graceful labelings
Column generation for the variable cost and size bin packing problem with fragmentation
On the Complexity of the Decisive Problem in Simple and Weighted Games
On Minimal and Minimum Hull Sets
Boltzmann sampling of ordered structures
Disjoint q -Steiner systems in dimension 13
Van der Corput Sequences and Linear Permutations
Mixed Moore Cayley graphs
Symplectic geometry, minors and graph Laplacians
Utilization of OpenCL for Large Graph Problems on Graphics Processing Unit
Report on models of write-efficient memories with localized errors and defects
The maximum number of halving lines and the rectilinear crossing number of K n for n
Solving Satisfiability using Decomposition and the Most Constrained Subproblem (Preliminary Report)
A note on counting orientations
Vertex fusion under diameter constraints
Collective Tree Spanners for Unit Disk Graphs with Applications
Weighted upper domination number
Wheels are Cycle-Antimagic
Hyperplane arrangements between Shi and Ish
A global reduction method for multidimensional size graphs
Approximating the cone of copositive kernels to estimate the stability number of infinite graphs
Maximal Sets of 2-Factors in Complete Equipartite Graphs
Weighted Graphs as Dynamical Interaction Systems
On Equidistant Constant Weight Codes
Geometric Thickness in a Grid of Linear Area
A representation for the modular-pairs of a P 4 -reducible graph by modular decomposition
Learning criteria weights with TOPSIS method and continuous VNS for multi-criteria inventory classification
Decompositions of highly connected graphs into paths of length five
On Adjacency and e-Adjacency in General Hypergraphs: Towards a New e-Adjacency Tensor
Approximating the Lovász θ Function with the Subgradient Method
Histories in Path Graphs
On Some Properties of Base-matroids
Pebbling in 2-Paths
Signed Zero-Divisor Graph
Claw-free graphs with non-clique mu-subgraphs and related geometries
The achromatic number of Kneser graphs
On coloring problems with local constraints
Extended Lagrange's four-square theorem
A generalization of interval orders
Intersection Dimension and Maximum Degree
Improved Bonferroni Inequalities and Binomially Bounded Functions
Existence Status of Some Previously Open Abelian Difference Sets
Contractible edges in minimally k-connected graphs
On Coloring Problems of Snark Families
A dynamic programming algorithm for the single-machine scheduling problem with deteriorating processing times
Induced Matchings in Intersection Graphs
On a Häggkvist's Conjecture with the Polynomial Method
A general lower bound on the weak Schur number
Partially Square Graphs, Hamiltonicity and Circumference II
Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs
On the Structure of Identifiable Graphs
STEINER-Diagrams
Well-located graphs: A collection of well-covered ones
Minimizing Travels by Maximizing Breaks in Round Robin Tournament Schedules
Further Results on Vertex Equitable Graphs
Finding multiplies solutions for non-linear integer programming
Outerplanar Obstructions for the Feedback Vertex Set
The Regular Graph of a Non-Commutative Ring
Chordal-(2, 1) graph sandwich problem with boundary conditions
Cyclic Codes of Length 2 e over Z 4
Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction
Counting disk graphs
A geometric approach to dense Cayley digraphs of finite Abelian groups
Using VNS for the Optimal Synthesis of the Communication Tree in Wireless Sensor Networks
Total Z-transformation graphs of perfect matching of plane bipartite graphs
A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems
Topological Graph Theory: A Personal Account
On the packing chromatic number of hypercubes
On some properties of PRNGs based on block ciphers in counter mode
Tropical matchings in vertex-colored graphs
A Branch-and-price Algorithm for the Multi-Vehicle Covering Tour Problem
Width and f-vectors of Cutsets in the Truncated Boolean Lattice
The unsatisfiability threshold revisited