yusuke1997/dblp-id-title huggingface dataset:
The D-representation of nonnegative integers and the Fibonacci factorization of suffixes of infinite Fibonacci words
An infinite family of normal 5-edge colorable superpositioned snarks
On minimizing width in linear layouts
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
Proving the infeasibility of Horn formulas through read-once resolution
Alexandroff pretopologies for structuring the digital plane
Aspects of discrete mathematics and probability in the theory of machine learning
Multilinear sets with two monomials and cardinality constraints
Uniform election in trees and polyominoids
An algorithm for identifying cycle-plus-triangles graphs
Tree spanners of bounded degree graphs
Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
Graph grabbing game on totally-weighted graphs
On time-relaxed broadcasting networks
Flexible flow shop with dedicated buffers
Incorporating predictions in online graph coloring algorithms
Special issue on stability in graphs and related topics
The external constraint 4 nonempty part sandwich problem
Integer -matchings of graphs
An ILP-refined tabu search for the Directed Profitable Rural Postman Problem
Queue layouts on folded hypercubes
The uncapacitated swapping problem on a line and on a circle
The P versus NP-complete dichotomy of some challenging problems in graph theory
Spectral properties of some structurally related graphs
On the signed Roman k-domination: Complexity and thin torus graphs
The matcher game played in graphs
Inequalities for Minimal Covering Sets in Set Systems of Given Rank
Fractional spanning tree packing, forest covering and eigenvalues
Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
Regular independent sets
Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity
On r-dynamic coloring of graphs
The minimum chromatic violation problem: A polyhedral approach
Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem
The Sheffer group and the Riordan group
On the Covering Radius of an Unrestricted Code as a Function of the Rate, Dual Distance
Constrained versions of Sauer's lemma
Lot sizing with minimum order quantity
On highly palindromic words: The ternary case
The number of nonisomorphic nonorientable 6-gonal embeddings of complete graphs
Dembowski-Ostrom polynomials and reversed Dickson polynomials
Exact Bounds on the Order of the Maximum Clique of a Graph
Cyclic deficiency of graphs
Probe location in the presence of errors: a problem from DNA mapping
Some results on the avoidance of vincular patterns by multisets
Induced 2-regular subgraphs in k-chordal cubic graphs
On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty
Generalization of matching extensions in graphs (III)
Rooted k-connections in digraphs
Some Combinatorial Properties of Self-reading Sequences
Maximal and Stochastic Galois Lattices
Steiner problem in Halin networks
Domination parameters in hypertrees and sibling trees
A new color change to improve the coloring of a graph
Changes in vertex status and the fundamental decomposition of a tree relative to a multiple (parter) eigenvalue
Subdivisions of integral base polytopes
Separating Lifted Odd-hole Inequalities to Solve the Index Selection Problem
Solving the problem about the second largest normalized Laplacian eigenvalue
Hamiltonian laceability of bubble-sort star graphs with edge-faults
Perfect Italian domination in graphs: Complexity and algorithms
Pasting gauges I: Shortest paths across a hyperplane
A study of 3-arc graphs
3D well-composed polyhedral complexes
A note on Reed-Muller codes
Partitioning of a graph into induced subgraphs not containing prescribed cliques
Minimizing the error of linear separators on linearly inseparable data
On cyclic edge-connectivity of fullerenes
Practical fixed length Lempel-Ziv coding
3D geo-graphs: Efficient flip verification for the spherical zoning problem
The Hall Number, the Hall Index, and the Total Hall Number of a Graph
A polynomial time algorithm for strong edge coloring of partial k -trees
Realizing Euclidean distance matrices by sphere intersection
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem
Even cycles and perfect matchings in planar graphs
An approximation result for the interval coloring problem on claw-free chordal graphs
Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015
Compact cactus representations of all non-trivial min-cuts
Cops that surround a robber
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
Perfect Roman domination in trees
On the existence of sports schedules with multiple venues
Some properties for a class of interchange graphs
Cutoff phenomenon for random walks on Kneser graphs
Transforms of pseudo-Boolean random variables
On searching strategies, parallel questions, and delayed answers
The Parity Path Problem on Some Subclasses of Perfect Graphs
Constructions for normal graphs and some consequences
Minimization on submodular flows
Unicyclic and bicyclic graphs with maximum exponential second Zagreb index
Robust Universal Complete Codes for Transmission and Compression
Locally definable vertex set properties are efficiently enumerable
Critical (P5,dart)-free graphs
Media theory: Representations and examples
Corrections of proofs for Hansen and Mélot's two theorems
Cross-series-parallel digraphs
The Transitive Minimum Manhattan Subnetwork Problem in 3 dimensions
The Ordered Gradual Covering Location Problem on a Network
The complexity of base station positioning in cellular networks
Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs
Average update times for fully-dynamic all-pairs shortest paths
Positive feedback loops and multistationarity
The complexity of finding arc-disjoint branching flows
Norm statistics and the complexity of clustering problems
Vertex-pancyclicity of edge-face-total graphs
A Strongly Polynomial Algorithm for the Inverse Shortest Arborescence Problem
On polynomial complexity of a stochastic algorithm for mixed zero-one programs
ILP and CP models for normalized integer weighted voting game design problem
Existence of EFX for two additive valuations
Continuous L-cluster methods
Computation on binary tree-networks
Localization game on geometric and planar graphs
Efficient algorithms for Roman domination on some classes of graphs
Novshek's trick as a polynomial algorithm
Induced Permutation Automata and Coverings of Strongly Connected Automata
Characterization and recognition of generalized clique-Helly graphs
Spanning cactus of a graph: Existence, extension, optimization, and approximation
Decision Theory and Discrete Mathematics
Characterization of facets of the hop constrained chain polytope via dynamic programming
Resistance values under transformations in regular triangular grids
Hosoya index of thorny polymers
Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics
A Recognition Algorithm for orders of Interval Dimension Two
Parallel Complexity of Partitioning a Planar Graph Into Vertex-induced Forests
Recognizing splicing languages: Syntactic monoids and simultaneous pumping
Families of optimal codes for strong identification
Paintshop, odd cycles and necklace splitting
Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs
Directed-ordered whist tournaments and ( v , 5, 1) difference families: existence results and some new classes of Z -cyclic solutions
Complexity of planar signed graph homomorphisms to cycles
The minimum degree Group Steiner problem
Minimum size tree-decompositions
Recognizing and representing proper interval graphs in parallel using merging and sorting
Approximation algorithms for a geometric set cover problem
On some properties of limited move stability, generalized metarationality, and policy equilibrium in bilateral conflicts
Narrowness, pathwidth, and their application in natural language processing
Ramsey and Gallai-Ramsey numbers for comb and sun graphs
Morphisms and Almost-periodicity
Finding the l-core of a tree
(Total) Vector domination for graphs with bounded branchwidth
Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
2-rainbow domination in generalized Petersen graphs P(n, 3)
Variable space search for graph coloring
Alternative group relaxation of integer programming problems
A hybrid framework of data hiding and encryption in H.264/SVC
Recolouring-resistant colourings
A 7/3-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams
A simple algorithm for secure domination in proper interval graphs
On the Fibonacci numbers of the composition of graphs
Facets of linear signed order polytopes
The robust selection problem with information discovery
Linear objective functions on certain classes of greedoids
BDDs--design, analysis, complexity, and applications
Panconnectivity of n-dimensional torus networks with faulty vertices and edges
Mean distance in a tree
Codes from lattice and related graphs, and permutation decoding
Domination game: Extremal families of graphs for 3/53/5-conjectures
On the p-connectedness of Graphs - A Survey
On storage of topological information
On the Use of Boolean Methods for the Computation of the Stability Number
The b-chromatic index of direct product of graphs
Stringology algorithms
On the Grace-Danielsson inequality for tetrahedra
A note on collections of graphs with non-surjective lambda labelings
Pseudo-Hamiltonian-connected graphs
The Equivalence Classes of LR Arrays
The NL-flow polynomial
On zero-sum free sequences contained in random subsets of finite cyclic groups
Dynamic coloring and list dynamic coloring of planar graphs
Non-crossing shortest paths lengths in planar graphs in linear time
Graphs admitting antimagic labeling for arbitrary sets of positive numbers
Formulas for cube roots in F 3 m
Hamiltonian Cycle is Polynomial on Cocomparability Graphs
On minimal Sturmian partial words
Matrix representation of consensus and dissent stabilities in the graph model for conflict resolution
On Bichromatic Triangle Game
Generalized domination in closure systems
Delta-wye reduction of almost-planar graphs
On the structure and deficiency of k-trees with bounded degree
Constructing Efficient Simulated Annealing Algorithms
A stability result for Berge-K3,t r-graphs and its applications
Envelopes and clutters
Anti-forcing polynomials for benzenoid systems with forcing edges
Average sizes of suffix trees and DAWGs
On the inverse sum indeg index
Bounds for eccentricity-based parameters of graphs
Bin covering with cardinality constraints
Flexing infinite frameworks with applications to braced Penrose tilings
Star-critical Ramsey numbers
Reinforcement learning for graph theory, I: Reimplementation of Wagner's approach
The Laplacian characteristic polynomial of the path-tree of the complete graph
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
Sum of weighted distances in trees
Exact arborescences, matchings and cycles
Two results about the hypercube
Choice identification of a graph
An efficient condition for a graph to be Hamiltonian
On the (signless Laplacian) spectral radius of minimally k-(edge)-connected graphs for small k
Existence of finite test-sets for k-power-freeness of uniform morphisms
A note on identities of two-dimensional languages
On derivatives of planar mappings and their connections to complete mappings
Models and algorithms for the Weighted Safe Set Problem
A degree condition of 2-factors in bipartite graphs
Computing the branchwidth of interval graphs
Faa' di Bruno's formula, lattices, and partitions
On the connectivity of diamond-free graphs
Expanding selfsimilar solutions of a crystalline flow with applications to contour figure analysis
Interdiction problems on planar graphs
The one-station bike repositioning problem
The interactive sum choice number of graphs
Complexity of Maker-Breaker games on edge sets of graphs
Total interval numbers of complete r-partite graphs
Partitions of multigraphs under minimum degree constraints
On the eccentric subtree number in trees
The complexity of minimizing and learning OBDDs and FBDDs
A note on coloring digraphs of large girth
A new Greedoid: the family of local maximum stable sets of a forest
On the independence polynomial and threshold of an antiregular k-hypergraph
Obituary: Peter C. Fishburn (1936-2021)
on Sparse Languages L such that LL = Sigma
Markov word patterns and a relation on α-words
(P 5 , diamond)-free graphs revisited: structure and linear time optimization
On extremal spectral results of digraphs based on sum distance
Minimum Multiway Cuts in Trees
On the sum minimization version of the online bin covering problem
On the edge dimension and the fractional edge dimension of graphs
A heuristic for the p-center problems in graphs
Reconstructing trees from digitally convex sets
Renting servers in the cloud: The case of equal duration jobs
Independence and upper irredundance in claw-free graphs
On the relative distances of nine or ten points in the boundary of a plane convex body
Shattering-extremal set systems from Sperner families
On the mean radius of permutation polytopes
Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation
Hamilton cycles in sparse locally connected graphs
Rainbow short linear forests in edge-colored complete graph
A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
A note on the number of matchings and independent sets in trees
Polyhedral methods for piecewise-linear functions I: the lambda method
On the maximum weight of a planar graph of given order and size
Graph extensions, edit number and regular graphs
On strong edge-colouring of subcubic graphs
A variation on bisecting the binomial coefficients
Relating multiway discrepancy and singular values of nonnegative rectangular matrices
Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width
A polynomial algorithm for minimizing discrete convic functions in fixed dimension
On regular and new types of codes for location-domination
An assignment algorithm with applications to integrated circuit layout
Planar graphs without 4-cycles and intersecting triangles are (1, 1, 0)-colorable
Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles
Kernelization hardness of connectivity problems in d-degenerate graphs
Salient and reentrant points of discrete sets
Harmonious colourings of graphs
Path eccentricity of graphs
Minor stars in plane graphs with minimum degree five
Unicyclic signed graphs with the first ⌊n+12⌋ largest energies
Maximum matching width: New characterizations and a fast algorithm for dominating set
Polyhedral approach to weighted connected matchings in general graphs
The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices
Generalized Partitions of Graphs
Submodular goal value of Boolean functions
A note on perfect Lee-codes over small alphabets
A note on the online hierarchical scheduling for lp-norm load balancing
Super restricted edge connectivity of regular edge-transitive graphs
Randomized strategies for the plurality problem
On the thinness and proper thinness of a graph
A generalization of the Lee distance and error correcting codes
On Perfect Switching Classes
A tight bound on the min-ratio edge-partitioning problem of a tree
Improving Local Search Heuristics for Some Scheduling Problems-I
Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
Greedy balanced pairs in N-free ordered sets
Microcomputer-based algorithms for large scale shortest path problems
Computing an eigenvector of an inverse Monge matrix in max-plus algebra
On the representation number of a crown graph
Approximation algorithms for the watchman route and zookeeper's problems
Bounds on the maximum modulus of dissociation roots
Codes over a family of local Frobenius rings, Gray maps and self-dual codes
Linear recursion properties of uncorrelated binary sequences
On nonrepetitive colorings of paths and cycles
A note on minimum degree conditions for supereulerian graphs
Transmitting in the n -Dimensional Cube
Distance measures for Interval Type-2 fuzzy numbers
On the Subword Equivalence Problem for Morphic Words
Algorithms for Routing around a Rectangle
The complexity of restricted star colouring
Grammars with valuations - a discrete model for self-organization of biopolymers
Richardson's Theorem for k-colored kernels in strongly connected digraphs
Polyhedral proof methods in combinatorial optimization
Exact bounds of the Möbius inverse of monotone set functions
On enumeration of the perfect binary codes of length 15
Full degree spanning trees in random regular graphs
On degeneracy in linear complementarity problems
Extremal problems for degree-based topological indices
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
On the growth of random knapsacks
A Min-max Relation for K 3 -covers in Graphs Noncontractible to K 5 e
On polynomial time inflation algorithm for loop-free non-negative edge-bipartite graphs
Double-super-connected digraphs
Dense on-line arbitrarily partitionable graphs
On the negation-limited circuit complexity of merging
The decycling number of generalized Petersen graphs
Preface: Stringology Algorithms
[1, 2]-sets in graphs
Scheduling with Batching: Two Job Types
A family of efficient six-regular circulants representable as a Kronecker product
Acute triangulations of trapezoids
H V -symmetric polyhedra and bipolarity
A mathematical program to refine gene regulatory networks
Bounds for the b -chromatic number of G - v
The Capacity of Monotonic Functions
Deterministic construction of compressed sensing matrices from constant dimension codes
Rigidity of Octahedral-tetrahedral Trusses
Four-regular graphs with rigid vertices associated to DNA recombination
Game total domination for cycles and paths
V-Order: New combinatorial properties & a simple comparison algorithm
A new approach on locally checkable problems
Column Scrambler for the GPT Cryptosystem
Complexity of Minimum Biclique Cover and Minimum Biclique Decomposition for Bipartite Domino-free Graphs
A fair and efficient solution to the socialist millionaires' problem
Distances between trees
Locating-total domination in graphs
Cartesian Products of Graphs as Subgraphs of De Bruijn Graphs of Dimension at Least Three
Optimal transport and integer partitions
Distribution of statistics on separable permutations restricted by a flat POP
Wiener index of some graph operations
Closed factorization
Monotonicity of Single-seat Preferential Election Rules
Path-driven orientation of mixed graphs
A note on the minimization of symmetric and general submodular functions
On the Pathwidth of Chordal Graphs
Distributive online channel assignment for hexagonal cellular networks with constraints
Uniquely solvable quadratic boolean equations
Sparsest cuts and bottlenecks in graphs
A note on generic rigidity of graphs in higher dimension
Dual bounded generation: Polynomial, second-order cone and positive semidefinite matrix inequalities
Strict neighbor-distinguishing index of K4-minor-free graphs
Edge-intersection graphs of boundary-generated paths in a grid
Busy agents on a line
Infinite quasi-transitive digraphs with domination number 2
Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
Uniquely identifying the edges of a graph: The edge metric dimension
On the vertices belonging to all, some, none minimum dominating set
Coloring {P2∪P3,house}-free graphs with Δ-1 colors
The Gowers U3 norm of one family of cubic power permutations
Analytic solutions for three taxon ML trees with variable rates across sites
Some analytic features of algebraic data
XAE and XEA robustness of max-min matrices
Bounds on the modified second Zagreb index
On RSA moduli with almost half of the bits prescribed
A decomposition algorithm for multi-terminal networks flows
Sparse Hypercube - Minimal k-line Broadcast Graph
Low time complexity algorithms for path computation in Cayley Graphs
Counterexamples to the conjecture on orientations of graphs with minimum Wiener index
Configurations induced by discrete rotations: periodicity and quasi-periodicity properties
Very fast parallel algorithms for approximate edge coloring
About some robustness and complexity properties of G-graphs networks
An efficient algorithm for group testing with runlength constraints
Chords of longest cycles in 3-connected graphs with some special circumferences
On strong edge-coloring of graphs with maximum degree 4
Unique-maximum edge-colouring of plane graphs with respect to faces
On r-dynamic chromatic number of graphs
Efficient algorithms on distributive lattices
Edge construction of molecular NSSDs
Well-covered graphs and factors
Flooding games on graphs
On the existence of vertex-disjoint subgraphs with high degree sum
Preface: The Second Malta Conference in Graph Theory and Combinatorics
Graphs without gap-vertex-labellings: Families and bounds
An interleaved method for constructing de Bruijn sequences
Efficient broadcast trees for weighted vertices
A proof of a conjecture on the differential of a subcubic graph
Improved approximation algorithms for weighted 2-path partitions
Linear orders and semiorders close to an interval order
Graph Classes Between Parity and Distance-hereditary Graphs
Algorithms for finding disjoint path covers in unit interval graphs
On pre-periods of discrete influence systems
On diregular digraphs with degree two and excess three
Combinatorial face enumeration in arrangements and oriented matroids
Optimal arrangement of data in a tree directory
Greedy colorings of words
A closed-form solution for the optimal release times for the F2 deteriorating jobs ∑w j C j problem
To vote or not to vote: What is the quota?
Facets of the three-index assignment polytope
Convexity in oriented graphs
Algebraic and topological closure conditions for classes of pseudo-Boolean functions
A characterization of competition graphs of arbitrary digraphs
On minimally rainbow k -connected graphs
Lift-and-project ranks of the set covering polytope of circulant matrices
Convexity preserving deformations of digital sets: Characterization of removable and insertable pixels
Dense sets and embedding binary trees into hypercubes
On n-facility median problem with facilities subject to failure facing uniform demand
Chordal co-gem-free and ( P 5 , gem)-free graphs have bounded clique-width
Upper bounds for the achromatic and coloring numbers of a graph
Models for fare planning in public transport
Bounds for parametric sequence comparison
Covering a Rectangle with Six and Seven Circles
Reconstructing Markov processes from independent and anonymous experiments
Maximally edge-connected graphs and Zeroth-order general Randić index for 0<α<1
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization ,
L(2, 1)-colorings and irreducible no-hole colorings of the direct product of graphs
The median function on median graphs and semilattices
Computing independent sets in graphs with large girth
Zero-one laws for k-variable first-order logic of sparse random graphs
Optimum basis of finite convex geometry
Closure-based constraints in formal concept analysis
Infinite classes of vectorial plateaued functions, permutations and complete permutations
An upper bound of Δ(E) < 3 / 2 for skiving stock instances of the divisible case
Spectral conditions of pancyclicity for t-tough graphs
A hierarchical framework for recovery in compressive sensing
From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-cats
Approximating connected safe sets in weighted trees
Relation between the skew energy of an oriented graph and its matching number
Generalized competitively orientable complete multipartite graphs
Existentially closed graphs via permutation polynomials over finite fields