yusuke1997/dblp-id-title huggingface dataset:
Study of Critical Sets in Latin Squares by using the Autotopism Group
Eulerian Cover with Ordered Enclosing for Flat Graphs
On the Local Approach to Sidorenko's Conjecture
Graph Mates
Vulnerability of Subclasses of Chordal Graphs
A random triadic process
Discrete Tomography in Discrete Deconvolution: Deconvolution of Binary Images Using Ryser's Algorithm
Perfect Matching of 3-uniform Hypergraphs
Performance Limits of Compound Codes with Symbol-Based Iterative Decoding
Multipolar routing: where dynamic and static routing meet
On Three Extensions of Equimatchable Graphs
Linear-time Algorithms for Maximum Sets of Sources and sinks
Contracting chordal graphs and bipartite graphs to paths and trees
The Colorful Helly Property for Hypergraphs
On L(k, k-1, ..., 1) labeling of triangular lattice
Linear time computation of the maximal sums of insertions into all positions of a sequence
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum
Location of Multiple Sub-Blocks with Burst Errors
Compatibility, Incompatibility, Tree-Width, and Forbidden Phylogenetic Minors
Multiple Packing in Sum-type Metric Spaces
Aggregate production planning problem. A new algorithm
Hamiltonian Chains in Hypergraphs
Packing of graphs and permutations
Colouring clique-hypergraphs of circulant graphs
Preface: Volume 5
The Flood-It game parameterized by the vertex cover number
Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope
Using mincuts to design secret sharing schemes in graphs
Heuristics for static cloudlet location
Bose-Burton type theorems for finite Grassmannians
Combinatorial Problems on H-graphs
Models and cutting-plane strategies for the tree-star problem
A Faster Implementation of Zelikovsky's 11/6-Approximation Algorithm for the Steiner Problem in Graphs
An efficient metaheuristic to improve accessibility by rural road network planning
Arithmetic relations in the set covering polyhedron of circulant clutters
Minimum d-Transversals of Maximum-Weight Stable Sets in Trees
On the Two-Architecture Connected Facility Location Problem
Characterization of affine Steiner triple systems and Hall triple systems
Enumerating semifields
Graph Models For Social Relations
Finding Folkman Numbers via MAX CUT Problem
On Quadratic Double Circulant Codes over Fields
Iterating Through Labelled Combinatorial Structures
Universal Sets of Quantum Information Processing Primitives and their optimal use
The minimum chromatic violation problem: a polyhedral study
A hypergraph approach to digital fingerprinting
An extension of the Erdös-Ko-Rado Theorem
An elementary proof of a conjecture on Graph-Automorphism
Minimizing total completion time on a batching machine with job processing time compatibilities
Embedding of Generalized Wheels into Arbitrary Trees
A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges
Clique-Coloring Circular-Arc Graphs
Regular two-point boundary value problems for the Schrödinger operator on a path
A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements
The (r, 1)-designs with 13 points
Erdős-Ko-Rado theorems in finite classical polar spaces
Reduced power graph of a group
Partitioning Chordal Graphs
Solving the 3-D Yard Allocation Problem for Break Bulk Cargo via Variable Neighborhood Search Branching
Clique number and ball containment number of unit ball graphs
Minimum cost paths over dynamic networks
An Ant Colony Algorithm for the Capacitated Vehicle Routing
Drawing a disconnected graph on the torus (Extended abstract)
Tomographic Reconstruction of Label Images from a Few Projections
On the S-Labeling problem
A characterization of weight-regular partitions of graphs
On the zone of a circle in an arrangement of lines
Good edge-labelling of graphs
Systems of Polynomials for Detecting Orientable Matroids
Cubicity of Interval Graphs and the Claw Number
Segmentation of Discrete Curves into Fuzzy Segments
Using DRL* relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut
The Orthogonal Art Gallery Theorem with Constrained Guards
Simultaneous Balancing and Scheduling of Flexible Mixed Model Assembly Lines with Sequence-Dependent Setup Times
Looseness width of 5-connected triangulations on the torus
Hereditary quasi-random properties of hypergraphs
A Randomized Version of Ramsey's Theorem
Modeling Skill Dependence in Probabilistic Competence Structures
The number of reachable pairs in a digraph
Solving Problems on Special Classes of Graphs
A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem
Dual Heuristics on the Exact Solution of Large Steiner Problems
Eccentric connectivity index of graphs with subdivided edges
Transitivity Model on Signed Graphs
1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs
Optical Routing of Uniform Instances in Cayley Graphs
Winning fast in biased Maker-Breaker games
Structures and Topological Indices of Commutting Involution Graphs
A Bayesian Approach to Tackling Hard Computational Problems (Preliminary Report)
Weak k-reconstruction of cartesian product graphs
Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs
Permutation Capacities and Oriented Infinite Paths
Extremal Bounds for Bootstrap Percolation in the Hypercube
Constructions of biregular cages of girth five
Large k-independent sets of regular graphs
... : The Way of the Bow
An all-substrings common subsequence algorithm
Intersecting codes and partially identifying codes
Construction and classification of Z 2 s -linear Hadamard codes
Balancedness and Correlation Immunity of Symmetric Boolean Functions
Optimal Ordering of Projections using Permutation Matrices and Angles between Projection Subspaces
Identifying Codes in Trees and Planar Graphs
Counting large distances in convex polygons: a computational approach
EURO Mini Conference (MEC XXVIII) on Variable Neighborhood Search
On avoding r-repetitions in ℝ 2
On cliques associated to 3-set packing problems
The Circuit Diameter of the Klee-Walkup Polyhedron
Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem
On Enumeration of Some Non-isomorphic Edge Complete Semigraphs
Total chromatic number of {square, unichord}-free graphs
A Doubly Exponentially Crumbled Cake
Regular factors in regular multipartite graphs
Absolute Matrix Summability Factors of Fourier Series with Quasi-f-Power Increasing Sequences
Coloring Toeplitz graphs
Variable neighborhood search for Multiple Level Warehouse Layout Problem
Abstract root systems and intervals in weak Bruhat order
On perfectly one-factorable cubic graphs
New blocking semiovals in PG(2, 5 2 )PG(2, 52) with a large homology group
An Evolutionary Algorithm for Automatic Recommendation of Clustering Methods and its Parameters
Non-zero disjoint cycles in highly connected group labeled graphs
The Plurality of Social Relations: kappa-Partite Representations of Interdependent Social Forms
Climbing discrepancy search for flowshop and jobshop scheduling with time lags
Cliques in graphs with bounded minimum degree
Incomparability graphs of the lattices L n and
Discrete Tomographic Reconstruction of 2D Polycrystal Orientation Maps From X-ray Diffraction Projections Using Gibbs Priors
Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks
On Posets of Page Number 2
Cubic bridgeless graphs have more than a linear number of perfect matchings
Packing minor closed families of graphs
Linear paths and trees in uniform hypergraphs
Cooperative model-based metaheuristics
Fleet management for autonomous vehicles using flows in time-expanded networks
On the Hadwiger number of hypercubes and its generalizations
Clique Graphs and Edge-clique graphs
Polyhedral Graphs with Extreme Numbers of Types of Faces
Nonexistence of (9, 112, 4) and (10, 224, 5) binary orthogonal arrays
Mathematical Modeling and Discrete Approximation in Evaluation and Forecasting of Expression-Data
Path Generation for Affine Flow Thinning
Decompositions of highly connected graphs into paths of any given length
On Finding Some New Excluded Minors for Gammoids
Factorization and catenary degree in 3-generated numerical semigroups
Formulations for designing robust networks. An application to wind power collection
Combinatorial designs and perfect codes
Topological methods for the existence of a rainbow matching
Location of distribution centers in a multi-period collaborative distribution network
Supersaturation Problem for the Bowtie
Constructions of universalized Sierpiński graphs based on labeling manipulations
MPI Parallelization of Variable Neighborhood Search
Graph labeling games
Some Formulations for the Group Steiner Tree Problem
Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs
Triangles n-Connectivity in Simplicial 2-Complexes
Work-troop scheduling for road network accessibility after a major earthquake
Minor related row family inequalities for the set covering polyhedron of circulant matrices
Variable Parameters Lengths Genetic Algorithm for Minimizing Earliness-Tardiness Penalties of Single Machine Scheduling With a Common Due Date
Distinctive power of the alliance polynomial for regular graphs
A Study on Hamiltonian Matroids
On the large sets of t-designs of size nine
An algorithm for solving parametric integer program
Edge-decompositions of graphs with high minimum degree
Zero Ring Labeling of Graphs
Convex Partitions of Graphs
Cut polytope has vertices on a line
Hamiltonian fault-tolerance of hypercubes
On the metric dimension of some families of graphs
On Aggregation Models Leading to Valued Preference Relations
Partitioning bases of topological spaces
A Procedure for Identifying the Best Skill Multimap in the Gain-Loss Model
On the path-avoidance vertex-coloring game
Computational determination of the largest lattice polytope diameter
Inapproximability Ratios for Crossing Number
A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set
On a tree-partition problem
Degree constrained subgraphs
A new Algorithm for Accelerating Pair-Wise Computations of Melting Temperature
Exact Method for Robotic Cell Problem
Lovász-Schrijver SDP-operator and a superclass of near-perfect graphs
Structure of the Extremal Family ex(n;tk p )
The 2-dominating set polytope of cycles and related graph classes
C -Cordial Labeling in Signed Graphs
On Some Uniformity of Distribution Properties of ESIGN
Semi-degree threshold for anti-directed Hamiltonian cycles
Generalized quadrangles of order s with a hyperbolic line consisting of regular points
Triangle-factors in powers of graphs
A note on some inequalities for the Tutte polynomial of a matroid
A min-max theorem for LIFO-search
Laplacian matrix of a weighted graph with new pendant vertices
Exact solution for branch vertices constrained spanning problems
The Kirchhoff index of unicycle weighted chains
Exponentially many nowhere-zero ℝ 3 -, ℝ 4 -, and ℝ 6 -flows
On Page Number of N-free Posets
Clique cycle transversals in distance-hereditary graphs
Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree
Linearly dependent vectorial decomposition of clutters
Rainbowness of plane graphs
Evolution of the giant component in graphs on orientable surfaces
Sets of Transformations as Criteria of Diversity within Sets of Objects
Kempe Equivalence of Colourings of Cubic Graphs
A Non-expensive Homological Helly Theorem
Balance and Filtering in Structured Satisfiable Problems (Preliminary Report)
Lifting and reduction of antimatroids
Prospective Network Flow Models and Algorithms for Bin Packing Problems
Models and Algorithms for Carsharing Systems and Related Problems
Further Results on Graceful Directed Graphs
Mathematical Programming with Stochastic Equilibrium Constraints applied to Optimal Last-mile Delivery Services
Rank of random half-integral polytopes - extended abstract -
Matching as the Intersection of Matroids
On the Metric Dimension of Join of a Graph with Empty Graph(O p )
Efficient algorithms for the 2-Way Multi Modal Shortest Path Problem
b-coloring of m-tight graphs
Coloring Meyniel graphs in linear time
Induced C 5 -free graphs of fixed density: counting and homogeneous sets
Automorphism Group and Fixing Number of (3, 6)- and (4, 6)-Fullerene Graphs
Tree-width of graphs and surface duality
On Modular Decomposition Concepts: the case for Homogeneous Relations
Dual approaches for a specific class of integer nonlinear programming problems
Low-Rank Matrix Recovery using Gabidulin Codes in Characteristic Zero
On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Source with Side Information
Intersection of Longest Paths in a Graph
Gracefully Cultivating Trees on a Cycle
Note on forcing pairs
Independent Domination in Triangle Graphs
Fly-automata for checking monadic second-order properties of graphs of bounded tree-width
A New Lower Bound for the Minimum Linear Arrangement of a Graph
Flip Graphs of Bounded-Degree Triangulations
On the Optimal Stars Clustering Tree Problem
Optimal Algorithm for Solution of Discrete Convex Combinations Problem
A central approach to bound the number of crossings in a generalized configuration
Modularity in random regular graphs and lattices
Improved bounds on acyclic edge colouring
Odd Harmonious Labeling of Some New Families of Graphs
Perfect subgraph/supergraph
Approximation of the Clustered Set Covering Problem
Clique cutsets beyond chordal graphs
On the Resistance Distance of a Tree
The ωψ-perfection of graphs
Spectral and Geometric Properties of k-Walk-Regular Graphs
On lambda-coloring split, chordal bipartite and weakly chordal graphs
A VNS approach for book marketing campaigns generated with quasi-bicliques probabilities
On some colorings of a double graph
Homomorphisms and Polynomial Invariants of Graphs
Coding cells of digital spaces: a framework to write generic digital topology algorithms
Linear Extension Diameter of Downset Lattices of 2-Dimensional Posets
The Edge-Diametric Theorem in Hamming Spaces
Upper bound for the number of perfect (n, 3)-codes
Fractional Turan's theorem and bounds for the chromatic number
Pancake Flipping with Two Spatulas
Functions over finite fields that determine few directions
On the Frame-Stewarr algorithm for the multi-peg Tower of Hanoi problem (Extended Abstract)
The dual code of small linear spaces
Bounds on the Hyperbolicity Constant
Unions of perfect matchings in cubic graphs
Reconstruction of a graph from 2-vicinities of its vertices ,
Embedded antichains in tournaments
A network model for routing-fault-free wavelength selection in WRONoCs design
Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem
Unique reconstruction of bounded sets in discrete tomography
Partitions of Rectilinear Polygons with Minimum Stabbing Number
Adjacency Matrix of a Semigraph
On the inclusion ideal graph of a ring
Graceful labeling of some zero divisor graphs
Load balancing optimization of telecommunication networks with two differentiated services
"Réseaux réguliers" or regular graphs
On Finding Another Room-Partitioning of the Vertices
Minimum Ck-saturated graphs
Unitary Cayley Meet Signed Graphs
Distributive Lattice Polyhedra
Graph Saturation Games
Symmetric Complete Sum-free Sets in Cyclic Groups
A construction of dense mixed graphs of diameter 2
Induced Path Transit Function, Betweenness and Monotonicity
Extension of the Zero-one k-law
Universality of Various Zeta-Functions
On the Vehicle Routing Problem with lower bound capacities
On the asymmetric representatives formulation for the vertex coloring problem
The Proportional Colouring Problem: Optimizing Buffers in Wireless Mesh Networks
Infinite Arrays and Domino Systems
Minimizing Profile of Graphs Using a Hybrid Simulating Annealing Algorithm
A "simple" rectangular puzzle
Bounds on Directed star arboricity in some digraph classes
Upper and lower bounding procedures for the minimum caterpillar spanning problem
Monochromatic trees in random graphs
Planarity Algorithms via PQ-Trees (Extended Abstract)
On generalized split graphs
Experiments with two heuristic algorithms for the Maximum Algebraic Connectivity Augmentation Problem
Stochastic nonlinear resource allocation problem
Covering planar graphs with forests, one having a bounded maximum degree
List Coloring of Planar Graphs with Forbidden Cycles
Minimal separators in P 4 -tidy graphs
Extremal Graph Theory for Metric Dimension and Diameter
The Forest Metrics for Graph Vertices
A pretopological approach for structuring data in non-metric spaces
Formal concept analysis for general objects
On symmetric quadrangulations
Path factors and line graphs
Rings of Graphs
On circulant thin Lehman matrices
NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors
On Finding Another
Slater orders and Hamiltonian paths of tournaments
On Vertex Partitions and the Colin de Verdière Parameter
Combinatorial equivalence of Chromatic Scheduling Polytopes
Non-separating cliques, asteroidal number and leafage. The minimal 4-asteroidal split graphs
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
Basic Structures of Some Interconnection Networks
The numerical semigroup of the integers which are bounded by a submonoid of N 2
Colorings of hypergraphs with large number of colors
Chip-firing via open covers
Construction of bimagic squares using orthogonal Sudoku squares (extended abstract)
Null and non-rainbow colorings of maximal planar graphs
Calibration of a type 2 controller applied to a buck converter: a multi-objective analysis
Clique-Critical Graphs
Entropy versions of additive inequalities
Weighted t-way Sequences
The number of tree stars is O * (1.357 k )
On the Spectrum of a Weakly Distance-Regular Digraph
The transversal numbers of linear systems with given 2-packing numbers
Hypercube 1-factorizations from extended Hamming codes
Computing the number of realizations of a Laman graph
Avoider-Enforcer: The Rules of the Game
On the Non-Minimal codewords of weight 2d min in the binary Reed-Muller Code
Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage
Random Graphs, Retractions and Clique Graphs
On-line scheduling with general machine cost functions
Criticality and Parallelism in GSAT
New Families of Ideal 2-Level Autocorrelation Ternary Sequences From Second Order DHT
Approximating connected facility location with buy-at-bulk edge costs via random sampling
Positive exponential sums, difference sets and recurrence
Hamilton cycles in the line graph of a random graph
Interpolation of the Discrete Logarithm in Finite Fields by Boolean Functions
A heuristic approach for an integrated fleet-assignment, aircraft-routing and crew-pairing problem
Strictly Interval Graphs: Characterization and Linear Time Recognition
Submodular function minimization in I and searching in Monge arrays
Review of Dynamic Stability Metrics and a Mechanical Model Integrated with Open Source Tools for the Container Loading Problem
Distributed Monitoring Problem
Permutrees
Restricted coloring problems on graphs with few P' 4 s
Some Theorems on Detachments Preserving Local-Edge-Connectivity
On Weight Hierarchies of Product Codes The Wei-Yang Conjecture and more
Biclustering as Strategy for Improving Feature Selection in Consensus QSAR Modeling
An improving dynamic programming algorithm to solve the shortest path problem with time windows
Dominating sets of random recursive trees
On the complexity of finding even pairs in planar perfect graphs
Conjectural upper bounds on the smallest size of a complete cap in PG(N, q), N ≥ 3
Asymptotics of the chromatic number for quasi-line graphs
On The Narumi-Katayama Index of Splice and Link of graphs
Using an Incomplete Version of Dynamic Backtracking for Graph Colouring
On the growth of components with non-fixed excesses
Infinite families of (n+1)-dichromatic vertex critical circulant tournaments
HMS: A hybrid multi-start algorithm for solving binary linear programs
Playing to retain the advantage
Chromatic numbers of the strong product of odd cycles
An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem
Reduction Rules for the Covering Tour Problem
On the structure of self-complementary graphs
Induced Ramsey-type theorems
Assymptotically efficient triangulations of the d-cube *
The rotational Dimension of a graph
A note on one-pebble two-dimensional Turing machines
Semi-preemptive routing on a line
On distance edge-colourings and matchings
Partitioning edge-coloured complete graphs into monochromatic cycles
A procedure of facet composition for the symmetric Traveling Salesman Polytope
Euler Complexes (Oiks)
Estimating the distance to a hereditary graph property
Preface and Introduction
The Simple Chromatic Number of Oriented Graphs
Approximability of the Multiple Stack TSP
ILP-Based Reduced Variable Neighborhood Search for Large-Scale Minimum Common String Partition
On the degrees of E-super vertex-magic graphs
Tree-decompositions of small pathwidth
A New Lower Bound for the Kirchhoff Index using a numerical procedure based on Majorization Techniques
A multistart constructive heuristic for sequencing by hybridization using adaptive memory
On Balanced Coloring Games in Random Graphs
A stronger bound for the strong chromatic index
Rainbow Matchings: existence and counting
Antibandwidth of Three-Dimensional Meshes
Improved approximation algorithm for the jump number of interval orders
Grouping cities based of their socio-economic indicators
Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method
Optimizing the throughput, service rate, and buffer allocation in finite queueing networks
High connectivity keeping connected subgraph
Distance and Short Parallel Paths in Augmented Cubes
An analysis of the 3gpp-MAC scheme
Complete arcs arising from a generalization of the Hermitian curve (extended abstract)
Resilience for the Littlewood-Offord Problem
Authorship attribution of texts: a review
Relations on Groups, Polygroups and Hypergroups
Balancedness of some subclasses of circular-arc graphs
Even-hole-free planar graphs have bounded treewidth
Metrical properties of a collection of 2D parallel thinning algorithms
(2, 1)-Total Labeling of a Class of Subcubic Graphs
The Lovász Local Lemma and Variable Strength Covering Arrays
Minimum Degree and Graph Minors
Three-way Metrics: Axiomatization and Properties
A Prim-based Heuristic Algorithm for Obstacle Avoiding Rectilinear Steiner Minimal Tree
Arc transitive distance regular covers of cliques
Deterministic Random Walks on Regular Trees
Links between Latin squares, nets, graphs and groups: Work inspired by a paper of A. Barlotti and K. Strambach
Discrete Concavity and Zeros of Polynomials
Spanning Forests of Digraphs and Limiting Probabilities of Markov Chains
On integrating an Iterated Variable Neighborhood Search within a bi-objective Genetic Algorithm: Sum Coloring of Graphs Case Application
Criticality of outer - connected independence upon edge removal
The complete classification of empty lattice 4-simplices
A Theory of Diversity
Combinatorics and Applications to Experimental Designs
Enumerating lattice 3-polytopes
Shellable posets arising from the even subgraphs of a graph
(m, e)-domination in Semigraphs
Symbolic and numerical computation in determining P-critical unit forms and Tits P-critical posets
On the possible volume of three way trades
Complexity of computing median linear orders and variants
Average Complexity of Addition Updates and Range Queries over an Array using Graphs
Variable neighborhood descent for the incremental graph drawing
Multimode extensions of Combinatorial Optimization problems
On cardinality constrained polymatroids
An upper bound on the rate of information transfer by Grover's oracle
A coding problem for pairs of subsets
Star Chromatic Index of Subcubic Graphs
On the dominating set polytope of web graphs
Green Design of Wireless Local Area Networks by Multiband Robust Optimization
Number of Crossing-Free Geometric Graphs vs. Triangulations
Perfect hypercubes
Modelling 3-configurations on Surfaces