yusuke1997/dblp-id-title huggingface dataset:
On combinatorial properties of the Arshon sequence
H-colouring Pt-free graphs in subexponential time
On relationship between Hamiltonian path and holes in -coloring of minimum span
Greediness is not always a vice: Efficient discovery algorithms for assignment problems
A cops and robber game in multidimensional grids
Perfect binary (n, 3) codes: the structure of graphs of minimum distances
An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
Minimization of an M-convex Function
The complete optimal stars-clustering-tree problem
Hardness results of global total k-domination problem in graphs
A characterization of cycle-free unit probe interval graphs
Preface: Levon Khachatrian's legacy in extremal combinatorics
A method for constructing artificial DNA libraries based on generalized de Bruijn sequences
Effect of predomination and vertex removal on the game total domination number of a graph
Maximal intervals of decrease and inflection points for node reliability
A lower bound on independence in terms of degrees
Unicyclic graphs of given girth k≥4 having smallest general sum-connectivity index
On the number of edges in some graphs
The b-hull of an integer program
Unicyclic and bicyclic graphs having minimum degree distance
Structural properties of resonance graphs of plane elementary bipartite graphs
Tree Scheduling with Communication Delays
Parametric bisubmodular function minimization and its associated signed ring family
A Communication Problem and Directed Triple Systems
Approximation algorithms for minimum (weight) connected k-path vertex cover
Matching preclusion for n-grid graphs
Revisiting Lagrangian relaxation for network design
On the tree-depth of random graphs
Some star-critical Ramsey numbers
Counting independent sets in tree convex bipartite graphs
New results on radio k-labelings of distance graphs
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Edge-disjoint rainbow triangles in edge-colored graphs
On a group testing problem: Characterization of graphs with 2-complexity c 2 and maximum number of edges
Geodeticity of the contour of chordal graphs
Using SPQR-trees to speed up recognition algorithms based on 2-cutsets
Vertex and edge metric dimensions of unicyclic graphs
Subgraphs with orthogonal factorizations in graphs
New classes of Facets for complementarity knapsack problems
Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
Inverse minimum flow problem under the weighted sum-type Hamming distance
An extended abstract of an indepth algorithmic and computational study for maximum flow problems
Redundancies of correction capability optimized Reed-Muller codes
Randomized algorithms in combinatorial optimization: A survey
Cyclic distance-preserving codes on a constant-weight basis
The p-maxian problem on interval graphs
A new distance metric on strings computable in linear time
The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation
Efficient Broadcasting with Linearly Bounded Faults
Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid
Oriented Ramsey numbers of some sparse graphs
2-Medians in trees with pos/neg weights
Examples of Products Giving Large Graphs with Given Degree and Diameter
The packing coloring problem for lobsters and partner limited graphs
A decomposition of the matroids with the max-flow min-cut property
Induction of M-convex functions by linking systems
On equivalent sets of functions
Heights of representative systems
Minimizing the Number of Tardy Jobs with Precedence Constraints and Agreeable Due Dates
Frustration-critical signed graphs
Fault diagnosability of DQcube under the PMC model
On the Wiener index, distance cospectrality and transmission-regular graphs
Characterizing width two for variants of treewidth
Short Encodings of Planar Graphs and Maps
Constructions of (vectorial) bent functions outside the completed Maiorana-McFarland class
On the connectivity properties and energy of Fibonomial graphs
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
Finding the Maximum and Minimum
On the Chvátal Rank of Polytopes in the 0/1 Cube
Flow trees for vertex-capacitated networks
Approximation ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs
Generalized Vertex Covering in Interval Graphs
Approximating earliest arrival flows with flow-dependent transit times
Online and offline packing cylinders in a cylindrical container
Sphere of Influence Graphs and the L-metric
Partitions of graphs and multigraphs under degree constraints
Antimatroids induced by matchings
A bijection between permutations and floorplans, and its applications
Grundy dominating sequences on X-join product
Enumerating floorplans with walls
Short signed circuit covers of signed graphs
Basic formulas and languages Part I. The theory
Hexagonal Systems with Forcing Single Edges
The clique operator on circular-arc graphs
Graphs with given number of cut vertices and extremal Merrifield-Simmons index
On a kind of restricted edge connectivity of graphs
Matchings in benzene chains
Computing the coarseness with strips or boxes
Network disconnection games: A game theoretic approach to checkpoint evaluation in networks
On the Sprague-Grundyfunction of Exact k-Nim
Compatible recurrent identities of the sandpile group and maximal stable configurations
Fast Detection and Display of Symmetry in Outerplanar Graphs
Efficient bounds for the stable set, vertex cover and set packing problems
A single axiom for Boolean algebras
Maximum transversal in partial Latin squares and rainbow matchings
On the complexity of finding multi-constrained spanning trees
Solving the Uncapacited Plant Location Problem on Trees
Enumerating near-4-regular maps on the sphere and the torus
The number of spanning trees of a family of 2-separable weighted graphs
k-Path Partitions in Trees
On common edges in optimal solutions to traveling salesman and other optimization problems
Vertex and edge metric dimensions of cacti
Intersection of chordal graphs and some related partition problems
Rational and Affine Expressions for Image Description
An improved randomized approximation algorithm for maximum triangle packing
Computing maximum non-crossing matching in convex bipartite graphs
On clique coverings of complete multipartite graphs
Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph
A type-B Tamari poset
A greedy algorithm for convex geometries
Rooted Routing in the Plane
On the Average Hamming Distance for Binary Codes
Level-2 networks from shortest and longest distances
Assessing the effect of multiple cost changes using reverse set tolerances
On the existence of maximal elements: An impossibility theorem
Large Cayley graphs of small diameter
An improved upper bound on the domination number of a tree
2-limited dominating broadcasts on cubic graphs without induced 4-cycles
Rainbow connection in oriented graphs
The minimum span of L(2, 1)-labelings of generalized flowers
A note on the minimum bounded edge-partition of a tree
Symmetric patterns in the cellular automaton that generates Pascal's triangle modulo 2
Some novel minimax results for perfect matchings of hexagonal systems
Exact wirelength of hypercubes on a grid
FPT algorithms for packing k-safe spanning rooted sub(di)graphs
Ordered size Ramsey number of paths
The optimal procedures for quantitative group testing
Charging station optimization for balanced electric car sharing
A note on periodic schedules for linear precedence constraints
Proof of a conjecture on the zero forcing number of a graph
On the number of transversals in Cayley tables of cyclic groups
Direct-optimal basis computation by means of the fusion of simplification rules
On algorithmic complexity of double Roman domination
Parity polytopes and binarization
Divider-based algorithms for hierarchical tree partitioning
Matching Parentheses in Parallel
The algebraic Monge property and path problems
The vehicle routing problem with pickups and deliveries on some special graphs
Circuit k-covers of signed graphs
On minimally b-imperfect graphs
Structural properties of LIC-planar graphs
Scheduling Independent Tasks with Multiple Modes
Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients
Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices
Coefficients of non-negative quasi-Cartan matrices, their symmetrizers and Gram matrices
On a lower bound on the number of perfect binary codes
A 4-approximation algorithm for the TSP-Path satisfying a biased triangle inequality
Facility location games with distinct desires
Homogeneous bent functions of degree n in 2n variables do not exist for n ge3
An old problem of Erdős: A graph without two cycles of the same length
Some results on {K2,C2i+1:i≥1}-factor in a graph
The spectrum and toughness of regular graphs
Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets
A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path
Coherent algebras and the graph isomorphism problem
The k-rainbow reinforcement numbers in graphs
Domination number, independent domination number and k-independence number in trees
Parallel Lempel Ziv coding
Scheduling Unitary Task Systems with Zero-one Communication Delays for Quasi-interval Orders
On the independence transversal total domination number of graphs
On card guessing game with one time riffle shuffle and complete feedback
Comparing Wiener complexity with eccentric complexity
Several extremal problems on graphs involving the circumference, girth, and hyperbolicity constant
Graphical partially ordered sets
Covering line graphs with equivalence relations
Grid obstacle representation of graphs
Approximation algorithm of maximizing non-submodular functions under non-submodular constraint
Relations between edge removing and edge subdivision concerning domination number of a graph
Recognition of probe proper interval graphs
Interval scheduling maximizing minimum coverage
On a conjecture involving a bound for the total restrained domination number of a graph
Improper interval edge colorings of graphs
On equivalent knapsack problems
A PPA parity theorem about trees in a bipartite graph
The six classes of trees with the largest algebraic connectivity
On Ramsey and star-critical Ramsey numbers for generalized fans versus nKm
On the number of realizations of certain Henneberg graphs arising in protein conformation
On the polyhedra of graceful spheres and circular geodesics
Antimagic orientation of lobsters
Perfect state transfer in NEPS of complete graphs
On Wiener index and average eccentricity of graphs of girth at least 6 and (C4,C5)-free graphs
Collapsible subgraphs of a 4-edge-connected graph
Threshold group testing with consecutive positives
Total Matchings and Total Coverings of Threshold Graphs
The intersection spectrum of hooked Skolem sequences and applications
Coordination without communication: the case of the flocking problem
Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions
New perspectives on semiring applications to dynamic programming
The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem
Applications of matrix morsifications to Coxeter spectral study of loop-free edge-bipartite graphs
Optimal Channel Allocation for Several Types of Cellular Radio Networks
The linear arboricity of K5-minor free graphs
A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs
Counting kernels in directed graphs with arbitrary orientations
On the monotonicity of games generated by symmetric submodular functions
On a geometric graph-covering problem related to optimal safety-landing-site location
Total k-domination in strong product graphs
Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph
Dominating plane triangulations
A lower bound for the non-oriented two-dimensional bin packing problem
Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
An exact algorithm for a class of geometric set-cover problems
Combinatoire des mots et étude quantitative de la sérialisabilité: Application à la concurrence d'accès à une base de données
On the maximal Wiener index and related questions
Group centralization of network indices
Correction to the paper: Patterson-Wiedemann construction revisited
Statistics on bargraphs viewed as cornerless Motzkin paths
Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
Recognizing a Class of Bicircular Matroids
Lift-and-project for Mixed 0-1 programming: recent progress
Linear coloring of sparse graphs
Graph-theoretical properties of parallelism in the digital plane
Effective resistances and spanning trees in the complete bipartite graph plus a matching
Complexity issues for the sandwich homogeneous set problem
The exponential growth of the packing chromatic number of iterated Mycielskians
On asteroidal sets in chordal graphs
Nordhaus-Gaddum type inequality for the fractional matching number of a graph
Upper bounds for the complexity of sequences generated by symmetric Boolean functions
On powers of graphs of bounded NLC-width (clique-width)
On the polynomiality of finding KDMDGP re-orders
On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane
Some spectral invariants of the neighborhood corona of graphs
Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees
A note on deterministic zombies
Separator-based graph embedding into multidimensional grids with small edge-congestion
Rainbow domination and related problems on strongly chordal graphs
E-super vertex magic labelings of graphs
Completely separable graphs
The number of additional variables required for the integer programming formulation
Hamiltonian index is NP-complete
An upper bound on the extremal version of Hajnal's triangle-free game
Parameterized extension complexity of independent set and related problems
Preserving Approximation in the Min-Weighted Set Cover Problem
Rainbow connectivity of Moore cages of girth 6
Erdős-Ko-Rado theorems on the weak Bruhat lattice
A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs
Applications of combinatorics to statics--rigidity of grid
Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations
On graphs without a C 4 or a diamond
Optimal Layout of Edge-weighted Forests
A survey on flows in graphs and matroids
Characterizations and enumerations of patterns of signed shifts
2-dimensional optical orthogonal codes from singer groups
Computing regions of interest for geometric features in digital images
Conditional connectivity of folded hypercubes
A generalization of the independence number
On pseudo 2-factors
Classifying the clique-width of H-free bipartite graphs
Multiprocessor scheduling under precedence constraints: Polyhedral results
Scheduling an unbounded batching machine with job processing time compatibilities
2-tone coloring of cactus graphs
The extremal values of the Wiener index of a tree with given degree sequence
A characterization of well-indumatchable graphs having girth greater than seven
A priori TSP in the scenario model
Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes - Part I
About the minimum mean cycle-canceling algorithm
Extremal problems on saturation for the family of k-edge-connected graphs
Optimal Orientations of Products of Paths and Cycles
On-line Ramsey numbers for paths and short cycles
Bounds on broadcast time in well-connected graphs
Structure and enumeration results of matchable Lucas cubes
Algorithm for recognizing Cartesian graph bundles
Fixed edge-length graph drawing is NP-hard
Fair division with multiple pieces
Distances in cocomparability graphs and their powers
The interval coloring impropriety of planar graphs
A note on double domination in graphs
The Cyclic Wirelength of Trees
The colourful feasibility problem
Paired threshold graphs
Berge coalitional stabilities in the graph model for conflict resolution
On lengths of edge-labeled graph expressions
On the complexity of partitioning graphs into connected subgraphs
An explicit formula for the solution of the Fisher-Wright selection model in population genetics
Algorithmic complexity of list colorings
An efficient polynomial-time approximation scheme for parallel multi-stage open shops
Bounds on a graph's security number
New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities
Minimum cost flow algorithms for series-parallel networks
Totally optimal decision trees for Boolean functions
Minimal enumerations of subsets of a finite set and the middle level problem
The probabilistic minimum dominating set problem
Enumerating connected induced subgraphs: Improved delay and experimental comparison
Algorithmic techniques for finding resistance distances on structured graphs
Partial and Perfect Path Covers of Cographs
Not Every 2-tough Graph Is Hamiltonian
Hitting times of random walks on unicyclic graphs with a given number of pendant vertices
Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip
New bounds and constraint propagation techniques for the clique partitioning problem
Periodicity vectors for labelled trees
A note on acyclic domination number in graphs of diameter two
Efficiency in exponential time for domination-type problems
Directed Moore Hypergraphs
A column generation based algorithm for the robust graph coloring problem
General eccentric connectivity index of trees and unicyclic graphs
Approximating a real number by a rational number with a limited denominator: A geometric approach
Cost thresholds for dynamic resource location
On Lower Bounds for Numbered Complete Graphs
Integer matrices with constraints on leading partial row and column sums
On resistance of graphs
Distinguishing numbers and distinguishing indices of oriented graphs
Recognizing Clique Graphs of Directed and Rooted Path Graphs
Graphs inducing totally balanced and submodular Chinese postman games
On the minimum average distance of binary codes: linear programming approach
Some New Results Concerning three Counterfeit Coins Problem
Cycle-aware minimization of acyclic deterministic finite-state automata
Some basic exchange properties in combinatorial optimization and their application to constructing the K-best solutions
Maximal strongly connected cliques in directed graphs: Algorithms and bounds
Extremal fullerene graphs with the maximum Clar number
Binary linear programming models for robust broadcasting in communication networks
Starting time minimization for the maximum job variant
Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix
Constructing fair sports league schedules with regard to strength groups
A classification result on weighted { delta v µ +1 , delta v µ ; N , p 3 }-minihypers
Closure spaces that are not uniquely generated
A d-move Local Permutation Routing for the d-cube
Nested hierarchies in planar graphs
Matrix representation of stability definitions in the graph model for conflict resolution with grey-based preferences
Large gaps in one-dimensional cutting stock problems
Representing orders on the plane by translating points and lines
Intersection Graphs of Helly Families of Subtrees
Resistance between two vertices of almost complete bipartite graphs
A value for cooperative games on simplicial complexes with a filtration
Local Multiple Alignment Via Subgraph Enumeration
Approximate strong equilibria in job scheduling games with two uniformly related machines
Degree sequences for k-regulable ribbon realizations
Pseudoachromatic and connected-pseudoachromatic indices of the complete graph
Pancyclic out-arcs of a Vertex in Tournaments
Analyzing quadratic unconstrained binary optimization problems via multicommodity flows
Orientable edge colorings of graphs
Tree Enterprises and Bankruptcy Ventures a Game Theoretic Similarity Due to a Graph Theoretic Proof
Fully dynamic recognition algorithm and certificate for directed cographs
Some inequalities for the atom-bond connectivity index of graph operations
Minimum length word-representants of graph products
Extremal bipartite graphs of given connectivity with respect to matching energy
The Pfaffian property of circulant graphs
Codage des polyominos convexes et équations pour l'énumération suivant l'aire
On the structure of connected locally GQ(3, 9)-graphs
Ordering connected graphs having small degree distances
t-CIS codes over GF(p) and orthogonal arrays
Progress towards the 1/2-Conjecture for the domination game
Computing the boxicity of a graph by covering its complement by cointerval graphs
Diameter vulnerability of graphs
An introduction to the deduction number
The k-in-a-tree problem for graphs of girth at least k
On reconstruction of eigenfunctions of Johnson graphs
Vertex and edge PI indices of Cartesian product graphs
Two-machine job-shop scheduling with one joint job
On the Deficiency of Bipartite Graphs
Bounded quantifier depth spectrum for random uniform hypergraphs
Vertex adjacencies in the set covering polyhedron
Two new approximation schemes for maximizing the weighted number of just-in-time jobs in a multi-machine proportionate flow shop
A minimax result for perfect matchings of a polyomino graph
The k-centrum multi-facility location problem
An Algorithm for an Eulerian Trail Traversing Specified Edges in Given order
Extremal general Gutman index of unicyclic graphs with given girth k
Block duplicate graphs and a hierarchy of chordal graphs
Exploring the concept of perfection in 3-hypergraphs
Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems
Hemisystems and strongly regular graphs
Comparing the sizes of nondeterministic branching read-k-times programs
Approximations for the Two-Machine Cross-Docking Flow Shop Problem
Exhaustive generation for permutations avoiding (colored) regular sets of patterns
Vertex-symmetric generalized Moore graphs
Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs
Enumeration of perfect matchings of a type of Cartesian products of graphs
The number of independent sets of unicyclic graphs with given matching number
Graphical representation of regular resonance structures and their linear dependence
A note on rainbow-free colorings of uniform hypergraphs
The core and the Weber set of games on augmenting systems
The (t, r) broadcast domination number of some regular graphs
An Applied Point Pattern Matching Problem: Comparing 2D Patterns of Protein Ppots
Edge-disjoint paths in faulty augmented cubes
Well-solvable cases of the QAP with block-structured matrices
Distinct distances and arithmetic progressions
Euclidean Spanner Graphs with Degree Four
Cooperative phenomena in crystals and the probability of tied Bord acount elections
The Territorial Raider game and graph derangements
Parameterized complexity of generalized domination problems
A deletion game on hypergraphs
A Unified Approach to the First Derivatives of Graph Polynomials
Equitable colorings of Cartesian products of graphs
The toll walk transit function of a graph: Axiomatic characterizations and first-order non-definability
Vertex-colouring of 3-chromatic circulant graphs
The κk-connectivity of line graphs
F-WORM colorings: Results for 2-connected graphs
Optimization tools for computing colorings of [1,...,n] with few monochromatic solutions on 3-variable linear equations
The Algorithmic Complexity of Minus Domination in Graphs
Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
On the fractional strong metric dimension of graphs
Automorphisms and blocking in simple games