yusuke1997/dblp-id-title huggingface dataset:
On the twin-width of near-regular graphs
Closures and heavy pairs for hamiltonicity
Graphs with bounded induced distance
Bipartite density of triangle-free subcubic graphs
On the clique-width of (4K1, C4, C5, C7)-free graphs
An analysis of the redundancy of graph invariants used in chemoinformatics
On the general sum-connectivity index of trees with given number of pendent vertices
Some applications of graph theory to the study of polymer configuration
On the Disc-structure of Perfect Graphs I the Co-paw-structure
Characterizing and recognizing LR-visibility polygons
Connectivity and diagnosability of center k-ary n-cubes
Existence of directed triplewhist tournaments with the three person property 3PDTWh(v)
Trees with the seven smallest and eight greatest Harary indices
Recursive method to solve the problem of "Gambling with God"
Embedding graphs as isometric medians
A heuristic approach to hard constrained shortest path problems
Distance constrained labelings of planar graphs with no short cycles
A strongly polynomial time algorithm for a constrained submodular optimization problem
The Set of Reversible 90/150 Cellular Automata Is Regular
Wiener index of quadrangulation graphs
An O(n log n) algorithm for a maxmin location problem
Forbidden Pairs of disconnected graphs for traceability and hamiltonicity
Wheel and star-critical Ramsey numbers for quadrilateral
Matchings in colored bipartite networks
Characterization of color patterns by dynamic H-paths
The relationship between the threshold dimension of split graphs and various dimensional parameters
Fault-tolerant Routings in Double Fixed-step Networks
On the signed total Roman domination and domatic numbers of graphs
Media theory
Mining approximate patterns with frequent locally optimal occurrences
Super graphs on groups, II
Geometric Methods to Solve Max-Ordering Location Problems
Maximum induced forests in random graphs
A polynomial time algorithm for solving a quality control station configuration problem
Contribution to attributive and object subcontexts in inferring good maximally redundant tests
N-extendible Posets, and How to Minimize Total Weighted Completion Time
A coloring problem on the n-cube
On different versions of the exact subgraph hierarchy for the stable set problem
On the convexity of independent set games
More facets from fences for linear ordering and acyclic subgraph polytopes
A relation between proximity and the third largest distance eigenvalue of a graph
Determining some graph joins by the signless Laplacian spectrum
On the equitable chromatic number of complete n-partite graphs
Algebraic structure of quasicyclic codes
Atom-bond connectivity index of trees
Satisfiability Threshold for Random XOR-CNF Formulas
A polynomial algorithm for constructing the clique graph of a line graph
Graphs G with nullity 2c(G)+p(G)-1
On the edge-connectivity of the square of a graph
Symmetric property and reliability of locally twisted cubes
Generating r-regular graphs
The power graph of a torsion-free group determines the directed power graph
Fractional matchings and the Edmonds-Gallai theorem
More on the complexity of defensive domination in graphs
Counting and enumerating aggregate classifiers
Stability Aspects of the Traveling Salesman Problem Based on K-best Solutions
Reliability analysis of Cayley graphs generated by transpositions
Some bounds on the largest eigenvalue of degree-based weighted adjacency matrix of a graph
On the anti-Ramsey number of forests
The σ -irregularity of trees with maximum degree 5
On 2-rainbow domination of generalized Petersen graphs
An intersection theorem for systems of finite sets
Wiener-type invariants of pancyclicity for t-tough graphs
A duality property for the set of all feasible solutions to an integer program
Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
Communication Complexity of two Decision Problems
Frustration and stability in random boolean networks
Algebraic expressions for Kekulé structure counts of nonbranched cata-condensed benzenoid
Extended finite automata over groups
On the structure of Laplacian characteristic polynomial for circulant foliation
Some new bounds for the energy of graphs
Complexity of colouring problems restricted to unichord-free and { square, unichord }-free graphs
On the event distance of Poisson processes with applications to sensors
Domination and location in twin-free digraphs
Antisymmetrical neural networks
Deterministic distributed construction of T-dominating sets in time T
Medians for Weight Metrics in the Covering Graphs of Semilattices
A survey on conflict-free connection coloring of graphs
A census of boundary cubic rooted planar maps
Graph vulnerability parameters, compression, and quasi-threshold graphs
A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective
Algorithmic Characterizations of Interval ordered Hypergraphs and Applications
On the structure of ( P 5 , gem)-free graphs
Antiblocking decoding
Some results about the inset edge and average distance of trees
Nearly equal distances in metric spaces
A unifying approach to descriptive geometry and mechanisms
A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem
On cyclic codes over Galois rings
Polynomial-time Algorithm for Computing Translocation Distance Between Genomes
On the P4-components of graphs
Parallel selection
Measures of closeness to cordiality for graphs
Unit dual quaternion directed graphs, formation control and general weighted directed graphs
Szeged index, edge Szeged index, and semi-star trees
Cops and attacking robbers with cycle constraints
Periodicity and repetitions in parameterized strings
Edge separators for quasi-binary trees
The induced path function, monotonicity and betweenness
Square coloring of planar graphs with maximum degree at most five
Edge-connectivity and edge-superconnectivity in sequence graphs
Interior and exterior functions of positive Boolean functions
Design and Analysis of Fault-Tolerant Multibus Interconnection Networks
Hamming weights of symmetric Boolean functions
The competition hypergraphs of doubly partial orders
On the Relations Between Arboricity and Independent Number Or Covering Number
Mutual exclusion scheduling with interval graphs or related classes, Part I
Tighter Representations for Set Partitioning Problems
Size of context in regenerative IL systems
The maximum number of complementary facets of a simplicial polytope
On the structure of arbitrarily partitionable graphs with given connectivity
A geometric lower bound on the extension complexity of polytopes based on the f-vector
The maximum atom-bond connectivity index for graphs with edge-connectivity one
Disjoint congruence classes and a timetabling application
A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness
Saturated boundary k-alliances in graphs
Noise-resilient group testing: Limitations and constructions
Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
The Roman {2}-domatic number of graphs
A hypocoloring model for batch scheduling
On the reciprocal degree distance of graphs
Pseudo-models and propositional Horn inference
Reconstruction of permutations distorted by reversal errors
On the minimum Kirchhoff index of graphs with a given number of cut vertices
Structural analysis of a fractional matching problem
DNA recombination through assembly graphs
Exploring algorithmic solutions for the Independent Roman Domination problem in graphs
Efficient m-ary Balanced Codes
On defensive alliances and strong global offensive alliances
Shattering a set of objects in 2D
Total domination stability in graphs
Parametrization of knowledge structures
Three-arc graphs: Characterization and domination
An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm
On the number of alternating paths in random graphs
On the 2-spanning cyclability of honeycomb toroidal graphs
On k-ary n-cubes: Theory and Applications
Strong robustness of randomized rumor spreading protocols
Spanning forests and the golden ratio
Partitioning single-molecule maps into multiple populations: algorithms and probabilistic analysis
Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs
Edge search number of cographs
The root location problem for arc-disjoint arborescences
Characterization of double-arborescences and their minimum length word-representants
Maximal independent sets in caterpillar graphs
The maximum infection time of the P3 convexity in graphs with bounded maximum degree
On a generalized model of labeled graphs
Degree sequence conditions for a graph to be disjoint path coverable
Minimum average-case queries of q+1-ary search game with small sets
On maximum planar induced subgraphs
The bipartite edge frustration of composite graphs
Optimal algorithms for dissemination of information in generalized communication modes
Ballot matrix as Catalan matrix power and related identities
Exact satisfiability of linear CNF formulas
Theoretical and computational approaches to determining sets of orders for ( k , g ) -graphs
Discounted tree solutions
Lower bounds and algorithms for the 2-dimensional vector packing problem
Multicommodity flows in graphs
Neighborhood hypergraphs of digraphs and some matrix permutation problems
Bounds on the differentiating-total domination number of a tree
Structure of (bull, diamond)-free graphs and its applications
Stable-iΠ partitions of graphs
A simplified graph parameter and its relationship to the modified Randić index
Connectivity and stochastic robustness of synchronized multi-drone systems
Unified All-pairs Shortest Path Algorithms in the Chordal Hierarchy
Eternally surrounding a robber
Criterion of generativeness of sets of rational probabilities by a class of Boolean functions
First-Fit coloring of {P 5 , K 4 -e}-free graphs
Any 2-asummable bipartite function is weighted threshold
On the ratio between maximum weight perfect matchings and maximum weight matchings in grids
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
Optimal Transmission Schedules in TWDM Optical Passive Star Networks
Tandem cyclic alignment
Some extremal graphs with respect to inverse degree
Generating permutations with given ups and downs
A note on odd/even cycles
Incidence choosability of graphs
Selected topics on assignment problems
Multicommodity flows in certain planar directed networks
Bounds on the crossing resolution of complete geometric graphs
Solving the clique cover problem on (bull, C4)-free graphs
Vertex-distinguishing Edge-colorings of 2-regular Graphs
The domination number of the graph defined by two levels of the n-cube
Measuring the Vulnerability for Classes of Intersection Graphs
Coding for a multiple access OR channel: A survey
Some decision and counting problems of the Duquenne-Guigues basis of implications
Acyclic k-connected subgraphs for distributed alternate routing in communications networks
On the complexity of unfrozen problems
The general position achievement game played on graphs
A note on additive choice number of planar graphs
Mim-Width I. Induced path problems
Structural decompositions, width parameters, and graph labelings
Graphs with Largest Number of Minimum Cuts
Some Methods for Counting the Spanning Trees in Labelled Molecular Graphs, Examined in Relation to Certain Fullerenes
Bounding the feedback vertex number of digraphs in terms of vertex degrees
A very personal reminiscence on the problem of computational complexity
Every Matroid Is a Submatroid of a Uniformly Dense Matroid
Surface digitizations by dilations which are tunnel-free
On the crossing numbers of K m square C n and K m, l square P n
Symmetry in complex networks
Some models of graphs for scheduling sports competitions
Circular Permutation Graph Family with Applications
A note on the conditional fault-tolerant strong Menger edge connectivity of regular graphs
Decreasing energy functions as a tool for studying threshold networks
m-Recognizability of sets closed under certain affine functions
Hamiltonicity, Diameter, Domination, Packing, and Biclique Partitions of Mycielski's Graphs
A class of acyclic digraphs with interval competition graphs
Balanced decomposition of a vertex-colored graph
The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters
On efficient domination for some classes of H-free bipartite graphs
Some Properties of Non-bicolorable Hypergraphs and the Four-color Problem
An approximate dynamic programming approach for multi-stage stochastic lot-sizing under a Decision-Hazard-Decision information structure
Investigating the b-chromatic number of bipartite graphs by using the bicomplement
Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices
Approximation algorithm for squared metric facility location problem with nonuniform capacities
Prokaryotic evolutionary mechanisms accelerate learning
From preemptive to non-preemptive speed-scaling scheduling
A characterisation of all feasible solutions to an integer program
Distributions on Bicoloured Binary Trees Arising from the Principle of Parsimony
On packing colorings of distance graphs
Steady state analysis of timed event graphs with time window constraints
A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
Constant memory routing in quasi-planar and quasi-polyhedral graphs
Modelling piecewise linear concave costs in a tree partitioning problem
Counting the number of p × q integer matrices more concordant than a given matrix
Permutation reconstruction from MinMax -Betweenness constraints
A finitely convergent procedure for facial disjunctive programs
Generalized Bicycles
Strong vertex Euclidean graphs
A-closed classes of idempotent functions of many-valued logic definable by binary relations
On the conversion of multivalued to Boolean dynamics
Lower bounds on two-terminal network reliability
Meyniel Weakly Triangulated Graphs II: A Theorem of Dirac
Local Search Algorithms for the k-cardinality Tree Problem
Estimating the r-colorability threshold for a random hypergraph
Functional dependencies distorted by errors
A semidefinite programming-based heuristic for graph coloring
An upper bound on the independence number of benzenoid systems
Extremal graphs with respect to two distance-based topological indices
A-classification of idempotent functions of many-valued logic
On r-uniform hypergraphs with circumference less than r
On the recognition of unit disk graphs and the Distance Geometry Problem with Ranges
Transit functions and pyramid-like binary clustering systems
Optimal transport for some symmetric, multidimensional integer partitions
Easy and hard bottleneck location problems
A Griesmer Bound for Linear Codes Over Finite Quasi-Frobenius Rings
Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
Characterising circular-arc contact B0-VPG graphs
Kernelization of edge perfect code and its variants
Characterization of trees with second minimum eccentricity energy
Game matching number of graphs
Which graphs are determined by their total number of walks?
Graphs with small Italian domatic number
Eccentricity matrix of corona of two graphs
On the domination number of the cartesian product of the cycle of length n and any graph
l -Parametric eigenproblem in max-algebra
On a complete set of generators for dot-depth two
Gallai-Ramsey numbers for graphs with chromatic number three
Web services composition: Complexity and models
The Riordan group
Paintability of complete bipartite graphs
A Variant of the Permutation Flow Shop Model with Variable Processing Times
Robust recoverable and two-stage selection problems
Alternative formulations for the obnoxious p -median problem
Liar's dominating set problem on unit disk graphs
Preface: LAGOS'21 - XI Latin and American Algorithms, Graphs, and Optimization Symposium - São Paulo - Brazil
Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs
Extending Shelling orders and a Hierarchy of Functions of Unimodal Simple Polytopes
Bipartite-perfect Graphs
Class Steiner Trees and VLSI-design
Bounds on the burning number
Algorithmic aspects of a general modular decomposition theory
Quadratic rotation symmetric Boolean functions
A new lower bound on the independence number of graphs
Basic formulas and languages: PART II.Applications to E0L systems and forms
On the Zagreb indices equality
Total list weighting of Cartesian product of graphs
Lower bounds on the independence number of certain graphs of odd girth at least seven
Solving NP-hard problems in 'almost trees': Vertex cover
An algorithm for single machine sequencing with release dates to minimize maximum cost
Competitive Video on Demand Schedulers for Popular Movies
A polyhedral model for enumeration and optimization over the set of circuits
A property of real-time trellis automata
Finding a minimum path cover of a distance-hereditary graph in polynomial time
Dynamic monopolies in two-way bootstrap percolation
A proof of a conjecture on the Randic index of graphs with given girth
How to fake an RSA signature by encoding modular root finding as a SAT problem
Atom divisor graph of a poset
The obnoxious center problem on weighted cactus graphs
Weil Descent of Jacobians
Chromatic numbers for facet colouring of some generalised associahedra
Uncovering Generalized-Network Structure in Matrices
Maximum Weight Independent Sets for (, triangle)-free graphs in polynomial time
An upper bound on Wiener Indices of maximal planar graphs
Outpaths in Semicomplete Multipartite Digraphs
Polymatroid-based capacitated packing of branchings
The weight balance function on trees
Matrix period in max-algebra
The stable fixtures problem - A many-to-many extension of stable roommates
Uniform Tag Systems for Paperfolding Sequences
A revisited quadratic vertex-kernel for Minimum Fill-In
A Manhattan Channel Router with Good Theoretical and Practical Performance
Is a Unit-time Job Shop Not Easier Than Identical Parallel Machines?
Degree conditions on distance 2 vertices that imply k-ordered Hamiltonian
Compatible 2-factors
Heuristics for the Minimum Rectilinear Steiner Tree Problem: New Algorithms and a Computational Study
Intersection-union systems
Paired 2-disjoint path cover of burnt pancake graphs with n-3 faulty elements
Rotational circulant graphs
Completely independent spanning trees in kth power of 2-connected graphs
Maximal dynamic polymatroid flows and applications
Erratum to: The lattice of closure systems, closure operators and implicational systems on a finite set: a survey: [Discrete Applied Mathematics 127(2) (2003) 241-269]
Semi-preemptive routing on trees
Small ℓ ℓ-edge-covers in k k-connected graphs
Maximizing the degree powers of graphs with fixed size
The Graph Motif problem parameterized by the structure of the input graph
Total domination number of grid graphs
On the treewidth of toroidal grids
Identification in Z2 using Euclidean balls
Group equality and equity in submodular maximization
Dyck paths and restricted permutations
Optimal (t, r) broadcasts on the infinite grid
Some special minimum k-geodetically connected graphs
A single-element extension of antimatroids
The number of P-vertices for acyclic matrices of maximum nullity
Majority problems of large query size
Aggregation of nonnegative integer-valued equations
Saturation numbers for tPk with k less than 6
Backbone colorings of graphs with bounded degree
On the Strong Chromatic Index of Cyclic Multigraphs
Gallai-Ramsey numbers for multiple triangles
Point matching under non-uniform distortions
Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP
Hamilton-connected claw-free graphs with small parameters
Properties of the d-dimensional earth mover's problem
Discriminative measures for comparison of phylogenetic trees
A new lower bound for the single row facility layout problem
On Cocolourings and Cochromatic Numbers of Graphs
On the nearest neighbor rule for the metric traveling salesman problem
Minimum Spanning Hypertrees
The Simulated Trading Heuristic for Solving Vehicle Routing Problems
Extremal results for graphs of bounded metric dimension
Degree conditions for disjoint path covers in graphs
Enumeration of irreducible binary words
Global triple Roman dominating function
Recognizing simple-triangle graphs by restricted 2-chain subgraph cover
Diverse fair allocations: Complexity and algorithms
Solving Hamiltonian Cycle by an EPT algorithm for a non-sparse parameter
Improved algorithms for the Steiner problem in networks
Embedding processes in combinatorial game theory
Applications of generalized matrix searching to geometric algorithms
A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
Opacity of a finite automaton, method of calculation and the Ising chain
The Modified Differencing Method for the Set Partitioning Problem with Cardinality Constraints
The Steiner k-Wiener index of graphs with given minimum degree
Faster and enhanced inclusion-minimal cograph completion
An O(tm log D) Algorithm for shortest paths
A generalization of Fibonacci and Lucas matrices
Triangulations and equality in the domination chain
Integer version of the multipath flow network synthesis problem
Eulerian orientations and vertex-connectivity
Optimal Cell Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization
Extremal polygonal cacti for bond incident degree indices
Directed weighted improper coloring for cellular channel allocation
Uniquely forced perfect matching and unique 3-edge-coloring
The Banzhaf power index for ternary bicooperative games
Bin-packing and Matchings in Threshold Graphs
Recoloring some hereditary graph classes
The saturation number of wheels
A new lower bound on graph gonality
Tree Partitioning Under Constraints - Clustering for Vehicle Routing Problems
Partitions of graphs into small and large sets
A Combinatorial Problem in Database Security
Gallai and ℓ-uniform Ramsey numbers of complete bipartite graphs
Balancing Problems in Acyclic Networks
On Kloosterman sums over finite fields of characteristic 3
Games played by Boole and Galois
Threshold functions for local properties of graphs: triangles
A supertree method for rooted trees
Nash-solvable two-person symmetric cycle game forms
Connectivity of iterated line graphs
Rethinking structural balance in signed social networks
Ranking the vertices of an r-partite paired comparison digraph
Pattern-avoiding (0, 1)-matrices and bases of permutation matrices
Representation of graphs by means of generalized metrics
k-edge Subgraph Problems
Neighborhood Subtree Tolerance Graphs
Lower bounds and reduction procedures for the bin packing problem
Independence, matching and packing coloring of the iterated Mycielskian of graphs
Characterization and algorithm for max-plus supereigenvector problem by parametric programming
Color-blind index in graphs of very low degree
Matchings and -matroids
Brick tabloids and the connection matrices between bases of symmetric functions
The Schrijver system of the flow cone in series-parallel graphs
Random walks and the effective resistance sum rules
On envy-free perfect matching
Combinatorial optimisation algorithms for a CAD workstation
M 2 -equipackable graphs
Matching polynomials of path-trees of a complete bipartite graph
Orbital shrinking: Theory and applications
The number of maximal independent sets in trees with a given number of leaves
The inverse problem for certain tree parameters
A note on orientations of mixed graphs
Localization game for random graphs
Approximation algorithms for group prize-collecting and location-routing problems
An algorithm for stochastic programs with first-order dominance constraints induced by linear recourse
On the minimal energy of conjugated unicyclic graphs with maximum degree at most 3
Z-transformation graphs of maximum matchings of plane bipartite graphs
On the von Neumann entropy of a graph
The Metropolis Algorithm for Graph Bisection
Local antimagic orientations of d-degenerate graphs