yusuke1997/dblp-id-title huggingface dataset:
The cyclic diagnosability of Cayley graphs generated by transposition trees
Chordal probe graphs
Seymour's Second Neighborhood Conjecture for 6-antitransitive digraphs
Trail Trap: A variant of Partizan Edge Geography
On the computational complexity of strong edge coloring
A linear time algorithm for the robust recoverable selection problem
An integer programming approach for solving a generalized version of the Grundy domination number
Optimal detection of two counterfeit coins with two-arms balance
On the complexity of the regenerator location problem treewidth and other parameters
The worst case behavior of a greedy algorithm for a class of pseudo-Boolean functions
Comparing the metric and strong dimensions of graphs
On unimodular graphs with a unique perfect matching
No graph with nullity η(G)=|V(G)|-2m(G)+2c(G)-1
Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
Burning a graph is hard
The Worst-case Analysis of the MULTIFIT Algorithm for Scheduling Nonsimultaneous Parallel Machines
On the chromatic forcing number of a random graph
A survey of scheduling with controllable processing times
On the computational complexity of edge concentration
Forbidden subgraphs and the König-Egerváry property
Generating irreducible copositive matrices using the stable set problem
Erratum to "Characterizing acyclic graphs by labeling edges" [Discrete Appl. Math. 164 (2014) 492-499]
Aspects of upper defensive alliances
Isometric embedding in products of complete graphs
Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI
Digraphs whose m-step competition graphs are trees
Restricted optimal pebbling is NP-hard
Bidual Horn Functions and Extensions
Constrained Matroidal Bottleneck Problems
L(p, q)-labeling of planar graphs with small girth
The convexity of induced paths of order three and applications: Complexity aspects
Antichains and completely separating systems - A catalogue and applications
Minimizing ESCT forms for two-variable multiple-valued input binary output functions
Computing zeta functions for ordinary formal groups over finite fields
Lossless text compression by means of binary-coded ternary number representation
On r-hued coloring of planar graphs with girth at least 6
Constructive characterizations for packing and covering with trees
Fixing knockout tournaments with seeds
On the list dynamic coloring of graphs
Erratum to "Locating a minisum circle in the plane" [Discrete Appl. Math. 157 (5) (2009) 901-912]
A generalization of the Hamiltonian cycle in dense digraphs
Distance and Eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs
Enumerating graphs via even/odd dichotomy
Transitive closure algorithm MEMTC and its performance analysis
List Colorings and Reducibility
An Optimal Parallel Algorithm for Node Ranking of Cographs
The cone of supermodular games on finite distributive lattices
Approximation Algorithms for the Geometric Covering Salesman Problem
Complete catalogue of graphs of maximum degree 3 and defect at most 4
Replacing cliques by stars in quasi-median graphs
A note on approximating the b -chromatic number
A tie-break model for graph search
On partitions with k corners not containing the staircase with one more corner
On the contour of bipartite graphs
On the Non-minimal Codewords in Binary Reed-Muller Codes
Further result on acyclic chromatic index of planar graphs
A Characterization of Overlap-Free Morphisms
On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization
Monotonicity and Efficient Computation of Optimal Dichotomous Search
Hardness of learning loops, monoids, and semirings
Lifting Cover Inequalities for the Precedence-constrained Knapsack Problem
Mixture decomposition of distributions by copulas in the symbolic data analysis framework
Optimal covering of the equidistant square grid network
The matching relaxation for a class of generalized set partitioning problems
Pairings for cryptographers
A greedy algorithm for maximizing a linear objective function
Alphabetic points in restricted growth functions
Improving the efficiency of parallel minimum spanning tree algorithms
A 2-approximation algorithm for the minimum weight edge dominating set problem
Affine inequivalence of cubic Maiorana-McFarland type bent functions
Formulations for the maximum common edge subgraph problem
Scheduling at Villa Vigoni
On a combinatorial problem in botanical epidemiology
A Hamilton sufficient condition for completely independent spanning tree
On the number of points with pairwise integral distances on a circle
Minimum general Gutman index of trees with a given diameter
Minimum restricted diameter spanning trees
Approximating covering integer programs with multiplicity constraints
Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs
On the spanning connectivity of tournaments
The basis graph of a bicolored matroid
Optimal online and offline algorithms for robot-assisted restoration of barrier coverage
Stable sets in two subclasses of banner-free graphs
Strongly separable matrices for nonadaptive combinatorial group testing
Splitting a graph into disjoint induced paths or cycles
Fractional Thue chromatic number of graphs
Covering points with orthogonal polygons
k-colored kernels
The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality
Hierarchical approach to the process planning problem
Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays
On sufficient spectral radius conditions for hamiltonicity
Vertex PI indices of four sums of graphs
The matching energy of a graph
Global security in claw-free cubic graphs
Zombie number of the Cartesian product of graphs
A note about online nonrepetitive coloring k-trees
Trees with large m-eternal domination number
Optimal communication algorithms for Manhattan Street networks
Erratum to: Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution [Discrete Appl. Math. 157 (2009) 3133-3151]
On the sum of the second Zagreb index and its reciprocal index for bicyclic graphs
Locating domination in bipartite graphs and their complements
Auclidean Steiner Minimal Trees with Obstacles and Steiner Visibility Graphs
The expanding search ratio of a graph
Volume computation for sparse Boolean quadric relaxations
Strict chordal and strict split digraphs
No-hole K-tuple (r+1)-distant Colorings of odd Cycles
Neighbor connectivity of pancake graphs and burnt pancake graphs
Voronoi Diagrams over Dynamic Scenes
Generalized knight's tours on rectangular chessboards
Data-independent neighborhood functions and strict local optima
A class of web-based facets for the generalized vertex packing problem
The interval ordering problem
Edge-splittings preserving local edge-connectivity of graphs
Size of downsets in the pushing order and a problem of Berlekamp
A bound for judicious k-partitions of graphs
Complete colorings of planar graphs
Computing finest mincut partitions of a graph and application to routing problems
4-coloring H-free graphs when H is small
The Permutahedron of Series-parallel Posets
Solving the skiving stock problem by a combination of stabilized column generation and the Reflect Arc-Flow model
List star edge-coloring of claw-free subcubic multigraphs
Two routing problems with the limitation of fuel
Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees
Alternating Hamiltonian circuits in edge-coloured bipartite graphs
2-Rainbow domination number of C n x C 5
The assignment problem with nearly Monge arrays and incompatible partner indices
On large ABC spectral radii of unicyclic graphs
Hamiltonian cycles in unitary prefix transposition rearrangement graphs
The walk distances in graphs
Fast computation of linear approximation of general word-oriented composite function
Compositions, decompositions, and conformability for total coloring on power of cycle graphs
On the number of cycles possible in digraphs with large girth
Design of electricity supply networks
Memory optimal dispersion by anonymous mobile robots
On the OBDD representation of some graph classes
A characterization of substar graphs
Empty pseudo-triangles in point sets
On BF-orderable graphs
An infinite family of graphs with a facile count of perfect matchings
Some Constructions of Superimposed Codes in Euclidean Spaces
A parameterization for a class of complete games with abstention
A decomposition structure of resonance graphs that are daisy cubes
The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs
Fixed topology alignment with recombination
Bicyclic graphs with maximal revised Szeged index
Directed Rectangle-visibility Graphs Have Unbounded Dimension
On the number of transversals in a class of Latin squares
Erasure-resilient codes from affine spaces
Synchronizing dynamic Huffman codes
Establishing Determinantal Inequalities for Positive-definite Matrices
Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices
A 3D 12-subiteration thinning algorithm based on P-simple points
Relation between the H-rank of a mixed graph and the girth of its underlying graph
On the Complexity of Linear Programming in the BSS-model
Multiplicative version of eccentric connectivity index
Set graphs. IV. Further connections with claw-freeness
On Bollobás-type theorems of d -tuples
Maximum weighted matching with few edge crossings for 2-layered bipartite graph
A note on Topological indices and coindices of disjunction and symmetric difference of graphs
Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes
On-line scheduling of small open shops
Spectral versions on Lovász's (a,b)-parity factor theorem in graphs
The binding number of Halin graphs
Intersecting Codes and Separating Codes
Universal Covers of Graphs: Isomorphism to Depth N-1 Implies Isomorphism to All Depths
Cycle structure in discrete-density models
Comparative results and bounds for the eccentric-adjacency index
Packing (1, 1, 2, 2)-coloring of some subcubic graphs
On the Two-connected Planar Spanning Subgraph Polytope
The discrete moment problem and linear programming
Minimum Spanning Tree Cycle Intersection problem
Tree loop graphs
Path factors in subgraphs
Locating Service Centers with Precedence Constraints
Maximizing a lower bound on the computational complexity
On the Laplacian spectral radius of bipartite graphs with fixed order and size
Exact capacitated domination: On the computational complexity of uniqueness
Comprehensive vs. comprehensible classifiers in logical analysis of data
Embedding Graphs of Small Size
On the Gutman index and minimum degree
Edge clique partition in (k, ℓ)-graphs
Enumeration and extensions of word-representants
On some difficult linear programs coming from set partitioning
Discrete approximations to real-valued leaf sequencing problems in radiation therapy
A note about games-composition dimension
The smallest pair of cospectral cubic graphs with different chromatic indexes
The crossing numbers of generalized Petersen graphs with small order
Irreducible Polynomials and Linear Recurring Arrays
Two-dimensional minimax Latin hypercube designs
Every toroidal graph without adjacent triangles is (4, 1) * -choosable
Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
On disks of the triangular grid: An application of optimization theory in discrete geometry
Weighted exchange distance of basis pairs
Towards optimal kernel for connected vertex cover in planar graphs
On inverse linear programming problems under the bottleneck-type weighted Hamming distance
Resource constrained assignment problems
1-perfectly orientable K4-minor-free and outerplanar graphs
Interval robustness of (interval) max-plus matrices
On chains of 3-connected matroids
How to Find overfull Subgraphs in Graphs with Large Maximum Degree
Infinite grid exploration with synchronous myopic robots without chirality
Complete forcing numbers of the Rook's graphs
A note on 1-planar graphs
A simple branching scheme for vertex coloring problems
A generalization of Sperner's theorem and an application to graph orientations
Min algebraic duality
On ε productions for terminals in E0L forms
Correlation Functions of a Family of Generalized Geometric Sequences
About S-packing coloring of 3-irregular subcubic graphs
Brush your trees!
Equivalence among optimization problems on matrix sets
A lower bound on the eccentric connectivity index of a graph
A note on regular classes in special Thue systems
(a, b)-rectangle patterns in permutations and words
Several bounds on the spectral radius of uniform hypergraphs
Packing 2- and 3-stars into (2,3)-regular graphs
Combined location and routing problems for drug distribution
Metric properties of Sierpiński triangle graphs
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth
Powers of geometric intersection graphs and dispersion algorithms
A Characterization of PQI Interval Orders
Extremal trees of given segment sequence with respect to some eccentricity-based invariants
Upper bounds on the global offensive alliances in graphs
Adjacency matrices of probe interval graphs
The Disjoint Shortest Paths Problem
On the complexity of graph tree partition problems
The incidentor coloring of multigraphs and its applications
Note on a pursuit game played on graphs
The Median Procedure in the Semilattice of Orders
A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem
Certifying coloring algorithms for graphs without long induced paths
Rectilinear paths with minimum segment lengths
Decompositions of graphs based on a new graph product
Exploring graphs with distinct M-eigenvalues: Product operation, Wronskian vertices, and controllability
On the robustness of the metric dimension of grid graphs to adding a single edge
A note on valid inequalities for PageRank optimization with edge selection constraints
Reconstruction of a graph from 2-vicinities of its vertices
Finite automata for languages of combinatorial interest: An order theoretical point of view
Extremal problems on the Atom-bond sum-connectivity indices of trees with given matching number or domination number
The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs
Connectivity of Kronecker products with complete multipartite graphs
S-packing coloring of cubic Halin graphs
Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs
Some results on maximum stable sets in certain P 5 -free graphs
Circular-arc hypergraphs: Rigidity via connectedness
Certain Boolean equations
Independent-set reconfiguration thresholds of hereditary graph classes
On optimal broadcasting in faulty hypercubes
Existence of all generalized fractional (g, f)-factors of graphs
A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
Polyhedral graphs with extreme numbers of types of faces
Maximum independent set and maximum clique algorithms for overlap graphs
On matroid parity and matching polytopes
Gaussian random projections for Euclidean membership problems
Arrival time dependent routing policies in public transport
Minimizing Broadcast Costs Under Edge Reductions in Tree Networks
Fault tolerant supergraphs with automorphisms
An Approximation Algorithm for a Single-Machine Scheduling Problem with Release Times and Delivery Times
Kirchhoff index in line, subdivision and total graphs of a regular graph
Packing, partitioning, and covering symresacks
The Single-Item Discrete Lotsizing and Scheduling Problem: Optimization by Linear and Dynamic Programming
Simple image set of (max, +) linear mappings
NP-hardness of the sorting buffer problem on the uniform metric
Some remarks on the stable matching problem
Proper generating trees and their internal path length
Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs
Two Machine Openshop Scheduling with Machine-dependent Processing Times
Characterization of random walks on space of unordered trees using efficient metric simulation
Partial enumeration algorithms for Two-Dimensional Bin Packing Problem with guillotine constraints
A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems
A generalization of Opsut's result on the competition numbers of line graphs
Several graph properties in terms of the multiplicative version of the first Zagreb index
A sufficient condition to extend polynomial results for the Maximum Independent Set Problem
Automating weight function generation in graph pebbling
Median Hyperplanes in Normed Spaces - A Survey
Approximating independent set in perturbed graphs
Extremal vertex-degree function index for trees and unicyclic graphs with given independence number
A note on Nordhaus-Gaddum inequalities for domination
The Solitaire Clobber game and the correducibility of k-connected graphs
Forbidding a set difference of size 1
Some new Z-cyclic whist tournaments
Equitable greedy scalar equilibria for coalitional semi-cooperative games
The fully weighted toughness of a graph
Alternating L-functions of finite digraphs
Negative Cycles in Complete Signed Graphs
Special issue on computational methods for graph coloring and its generalizations
On the Kirchhoff index and the number of spanning trees of cylinder/Möbius pentagonal chain
Classes of cycle bases
A survey of results for sequencing problems with controllable processing times
Counting truth assignments of formulas of bounded tree-width or clique-width
Which generalized Randic indices are suitable measures of molecular branching?
Bounds on the 2-domination number
Cell rotation graphs of strongly connected orientations of plane graphs with an application
Bounds for the energy of weighted graphs
Weak oddness as an approximation of oddness and resistance in cubic graphs
On minimal vertex separators of dually chordal graphs: Properties and characterizations
A Note on Biased and Non-biased Games
Limited Packing and Multiple Domination problems: Polynomial time reductions
Some General Aspects of the Framing Number of a Digraph
R3-connectivity of folded hypercubes
Interval orders Based on Weak orders
Trace monoids with some invertible generators: two decision problems
Time-relaxed broadcasting in communication networks
An exact algorithm for the bottleneck 2-connected k-Steiner network problem in L p planes
On hard instances of non-commutative permanent
On the zero blocking number of rectangular, cylindrical, and Möbius grids
10th Andalusian Meeting on Discrete Mathematics
Deterministic walks with choice
The threshold dimension of a graph
Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping
On the tree packing problem
Quasi-λ-distance-balanced graphs
On weak double Roman domination in graphs
The bank safe problem
On graphs with maximum average eccentricity
Approximating the treewidth of AT-free graphs
Tight-optimal circulants vis-à-vis twisted tori
Two-to-one functions from Galois extensions
Sombor index of maximal outerplanar graphs
On the information ratio of graphs without high-degree neighbors
Digital circles, spheres and hyperspheres: From morphological models to analytical characterizations and topological properties
Erratum to: The incidence game chromatic number [Discrete Appl. Math. 157(9) (2009) 1980-1987]
The complexity of tropical graph homomorphisms
Counting the minimum number of arcs in an oriented graph having weak diameter 2
A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm
An improved lower bound on the independence number of a graph
A Study of Maximum Unit-circle Caterpillars - Tools for the Study of the Shape of Adsorption Patterns
Periodic template tests: A family of statistical randomness tests for a collection of binary sequences
Maximum bond incident degree indices for trees and unicyclic graphs with given maximum degree
Tricyclic graphs with maximum Merrifield-Simmons index
On forcing matching number of boron-nitrogen fullerene graphs
Surrogate duality relaxation for job shop scheduling
On spectral radius of generalized arithmetic-geometric matrix of connected graphs and its applications
A wrap error attack against NTRUEncrypt
Valuations and closure operators on finite lattices
On Maximal Shadows of Members in Left-compressed Sets
On graph contractions and induced minors
On packing and covering polyhedra of consecutive ones circulant clutters
Cardinality constrained minimum cut problems: complexity and algorithms
A simple linear time algorithm for cograph recognition
New lower bound for 2-identifying code in the square grid
On the t -pebbling number and the 2 t -pebbling property of graphs
A set partitioning approach to shunting
On a connection between the Pascal, Stirling and Vandermonde matrices
A continuous strategy to solve a class of mixed optimization problems
The Intermediate Price of Anarchy (IPoA) in bin packing games
An algorithmic separating hyperplane theorem and its applications
Structural results on circular-arc graphs and circle graphs: A survey and the main open problems
A faster algorithm for Cops and Robbers
A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees
Precoloring extension involving pairs of vertices of small distance
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs
Greedy versus recursive greedy: Uncorrelated heuristics for the binary paint shop problem
Sharp lower bounds on the fractional matching number
Characterization and algorithms of curve map graphs
Connected domination in maximal outerplanar graphs
Further results on atom-bond connectivity index of trees
Locally bounded hereditary subclasses of k-colourable graphs
Counting rotation symmetric functions using Polya's theorem
Lower Bounds for the Job-shop Scheduling Problem on Multi-purpose Machines
Resistance distance in connected balanced digraphs
The infection time of graphs
Game edge-connectivity of graphs
Approximation algorithms for constrained generalized tree alignment problem
Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition
Computational advances in combinatorial optimization
Edge-disjoint spanning trees and forests of graphs
On inertia and ratio type bounds for the k-independence number of a graph and their relationship
The average order of a connected vertex set in generalized ladder graphs
Nut digraphs
A note on the global offensive alliances in graphs
A lattice structure for ancestral configurations arising from the relationship between gene trees and species trees
Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks
Constructions of 2-rotation symmetric bent functions based on Maiorana-McFarland's bent function
On the Complexity of two Circle Connecting Problems
P 4 -Trees and Substitution Decomposition
The competition-common enemy graph of a digraph
Lower bounds for three algorithms for transversal hypergraph generation
The spectral radius of 3-graphs without Berge paths of given length
Permutation patterns in genome rearrangement problems: The reversal model
On total domination vertex critical graphs of high connectivity
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
Acquisition-extremal graphs
Circular backbone colorings: On matching and tree backbones of planar graphs
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
On the b-chromatic number of cartesian products
The t-median function on graphs
Generalized list T-colorings of cycles
Computing the matching and independence polynomials of double hexagonal chains
Longest alternating subsequences of k-ary words
Minimizing a monotone concave function with laminar covering constraints
On realizations of a joint degree matrix
Interior and Exterior Functions of Boolean Functions
Lower bounds on the mim-width of some graph classes