yusuke1997/dblp-id-title huggingface dataset:
Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms)
A note on the convexity number of the complementary prisms of trees
On pancyclic arcs in hypertournaments
Supermodular functions and the complexity of MAX CSP
Meyniel Weakly Triangulated Graphs - I: Co-perfect Orderability
An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees
Integral cographs
On one extension of Dirac's theorem on Hamiltonicity
On the structure of 4-regular planar well-covered graphs
Scientific contributions of Leo Khachiyan (a short overview)
Propagation time for zero forcing on a graph
Boundary uniqueness of fusenes
Improving the characterization of P-stability for applications in network privacy
On Physical Mapping and the Consecutive Ones Property for Sparse Matrices
On general ABC-type index of connected graphs
Minimum spanning tree cycle intersection problem on outerplanar graphs
Sublinear approximation algorithms for boxicity and related problems
New semidefinite programming relaxations for the Linear Ordering and the Traveling Salesman Problem
Computing the Jump Number on Semi-orders Is Polynomial
The Complexity of One-Machine Batching Problems
Representing graphs implicitly using almost optimal space
Generic iterative subset algorithms for discrete tomography
The terminal-pairability problem in complete bipartite graphs
A perfect matching algorithm for sparse bipartite graphs
Independence and Average Distance in Graphs
Robust cutpoints in the logical analysis of numerical data
A polynomial recognition of unit forms using graph-based strategies
On graphs whose eternal vertex cover number and vertex cover number coincide
Optimal algorithms for online batch scheduling with all possible equal-processing times under periodic pulse interruptions
Strongly connected orientations of plane graphs
Resistance distance-based graph invariants of subdivisions and triangulations of graphs
Which matrices are immune against the transportation paradox?
A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs
Vertex-splitting and Chromatic Index Critical Graphs
Glimpses are forever in RC4 amidst the spectre of biases
Special Issue on Typical Case Complexity and Phase Transitions
The strong chromatic number of partial triple systems
The principal partition of a pair of graphs and its applications
A combinatorial approach to a general two-term recurrence
Completeness of temporal logics over infinite intervals
The resistance distance of a dual number weighted graph
Pure Nash equilibria of competitive diffusion process on toroidal grid graphs
Enumeration of coloured plane trees with a given type partition
Dynamic storage allocation with limited compaction - complexity and some practical implications
Further generalizations of the Wythoff game and the minimum excludant
Gap Strings and Spanning Forests for Bridge Graphs of Biconnected Graphs
Locating and paired-dominating sets in graphs
On hypercube labellings and antipodal monochromatic paths
Counting dendrograms: A survey
The ϵ -spectral radii of k -uniform hypertrees
The precedence constrained knapsack problem: Separating maximally violated inequalities
Two equivalent measures on weighted hypergraphs
Finding the k most vital edges with respect to minimum spanning trees for fixed k
UET scheduling with unit interprocessor communication delays
Gross substitution, discrete convexity, and submodularity
Computing covers using prefix tables
Solving a multicoloring problem with overlaps using integer programming
Geometric Tree Graphs of Points in Convex Position
Construction of Discrete Structures, Especially Isomers
Multiple packing in sum-type metric spaces
Greedy concepts for network flow problems
On the structure and stability number of P 5 - and co-chair-free graphs
On the sum of the squares of all distances in bipartite graphs with given connectivity
The parameterized complexity of the induced matching problem
A mixed integer programming model for the cyclic job-shop problem with transportation
On graphs uniquely defined by their K-circular matroids
The complexity of the T-coloring problem for graphs with small degree
List recoloring of planar graphs
On convergence of scatter search and star paths with directional rounding for 0-1 mixed integer programs
One-Story Buildings as Tensegrity Frameworks III
Packing two trees into a graph with restrained maximum degree
Partial Petrial polynomials for complete graphs and paths
On the Fixed Interval Due-date Scheduling Problem
Sprague-Grundy values and complexity for LCTR
Algebraic degree of spectra of Cayley hypergraphs
Clique cover products and unimodality of independence polynomials
Skew partitions in perfect graphs
The even adjacency split problem for graphs
Integration of topological measures for eliminating non-specific interactions in protein interaction networks
Enumerating models of DNF faster: Breaking the dependency on the formula size
New bounds on clique-chromatic numbers of Johnson graphs
Polynomial Algorithms for (integral) Maximum Two-flows in Vertex Edge-capacitated Planar Graphs
On generalized zeta functions of formal languages and series
Physical Network Design to Facilitate Capacity Reallocation
Sum-free cyclic multi-bases and constructions of Ramsey algebras
Structural Aspects of Ordered Polymatroids
On finding most uniform spanning trees
The complexity of 2-intersection graphs of 3-hypergraphs recognition for claw-free graphs and triangulated claw-free graphs
On the global offensive alliance number of a graph
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
Scheduling with Forbidden Sets
Distance three labelings of trees
An extremal problem for edge domination insensitive graphs
A note on power domination in grid graphs
Local optimization on graphs
A note on the precedence-constrained class sequencing problem
Balanced 2p-variable rotation symmetric Boolean functions with optimal algebraic immunity
Defining binary phylogenetic trees using parsimony: New bounds
House of Graphs: A database of interesting graphs
On cyclic <m,n>-enumerations
Size of random Galois lattices and number of closed frequent itemsets
A Random Polynomial Time Algorithm for Well-rounding Convex Bodies
The complexity of point configurations
Degree sum and graph linkage with prescribed path lengths
Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, "The disjunctive procedure and blocker duality"
Interpretations for the Tutte polynomials of morphisms of matroids
The second Zagreb indices of unicyclic graphs with given degree sequences
On the number of edges in a graph with many two-hop disjoint paths
optimal Computation of Census Functions in the Postal Model
Making the components of a graph k-connected
Hard coloring problems in low degree planar bipartite graphs
Stability number and chromatic number of tolerance graphs
Approximating Graphic Min-Max and Minimum Cycle/Path/Tree Cover Problems
On routing in VLSI design and communication networks
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
The exact subgraph hierarchy and its vertex-transitive variant for the stable set problem for Paley graphs
On leaky forcing and resilience
On the roots of domination polynomial of graphs
One-to-many node-disjoint paths of hyper-star networks
Characterization and representation problems for intersection betweennesses
Matrice de ramification des arbres binaires
Multi-player Small Nim with Passes
Reliability Evaluation of Large Telecommunication Networks
Domination analysis for minimum multiprocessor scheduling
Fast approximation for computing the fractional arboricity and extraction of communities of a graph
A bijection between bargraphs and Dyck paths
Fall colouring of bipartite graphs and cartesian products of graphs
Better upper bounds on the QOBDD size of integer multiplication
Open problems on the exponential vertex-degree-based topological indices of graphs
Max point-tolerance graphs
Iterated open neighborhood graphs and generalizations
On the degree of homogeneous bent functions
Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption
Monotone Boolean formulas can approximate monotone linear threshold functions
Bounds on the locating-total domination number of a tree
Wiener index of Eulerian graphs
On the limit of branching rules for hard random unsatisfiable 3-SAT
Delta additive and Delta ultra-additive maps, Gromov's trees, and the Farris transform
About the number of directed paths in tournaments
A characterization of P 5 -free, diameter-2-critical graphs
On good algorithms for determining unsatisfiability of propositional formulas
Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs
On the number of blocks required to access the core
Cycles embedding on folded hypercubes with faulty nodes
New Complexity Results on Scheduling with Small Communication Delays
A class of functions with low-valued Walsh spectrum
Competition graphs of degree bounded digraphs
The energy of q q-Kneser graphs and attenuated q q-Kneser graphs
The radius and center of Fibonacci-run graphs
The micro-world of cographs
Sparse broadcast graphs
Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs
Extending single tolerances to set tolerances
Maxima of the Aα-index of graphs with given size and domination number
Strong equality of Roman and weak Roman domination in trees
How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks
Polynomial algorithm for finding the largest independent sets in graphs without forks
A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
Solving Restricted Line Location Problems via a Dual Interpretation
An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
Advances on sorting by reversals
Shuffling matrices, Kronecker product and Discrete Fourier Transform
Probabilistic analysis of some euclidean clustering problems
The biclique partitioning polytope
A recognition algorithm for simple-triangle graphs
Constant delay lattice train schedules
On the tiling by translation problem
Scheduling projects with labor constraints
Complete Linear Descriptions of Small Asymmetric Traveling Salesman Polytopes
Cost-Performance Tradeoffs for Interconnection Networks
Vector TSP: A Traveling Salesperson Problem with Racetrack-like acceleration constraints
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
Hardness results on the gapped consecutive-ones property problem
Orthogonal Double Covers of Complete Graphs by Trees of Small Diameter
Resistance distance in generalized core-satellite graphs
Branchwidth is (1,g)-self-dual
The completely independent spanning trees in P4-free graphs
1-vertex-fault-tolerant cycles embedding on folded hypercubes
On the toll number of a graph
Binomial-combinatorial properties of clar structures
An improved approximation algorithm for Hypergraph Max p-Section
The complexity of irredundant sets parameterized by size
Proportional and maxmin fairness for the sensor location problem with chance constraints
Word length perturbations in certain symmetric presentations of dihedral groups
Analyzing and Visualizing Sequence and Distance Data Using SplitsTree
Random Hypergraphs and topological gelation criterion for crosslinked polymer systems
Cyclic and negacyclic codes over the Galois ring GR(p 2 , m)
Decomposing the feasibility of Clustered Spanning Tree by Paths
Sensitivity Analysis for Knapsack Problems: Another Negative Result
A new algorithmic framework for basic problems on binary images
Outer-independent total Roman domination in graphs
On approximate enhanced covers under Hamming distance
Chvátal-Gomory cuts for the Steiner tree problem
Convergence and correctness of belief propagation for weighted min-max flow
Reseaux et polynomes de denombrement
Hexagonal Systems with Fixed Bonds
The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes
Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions
Investigations on c-boomerang uniformity and perfect nonlinearity
On the number of vertices belonging to all maximum stable sets of a graph
On the Kőnig-Egerváry index of a graph
The simultaneous metric dimension of graph families
The number of dissociation sets in connected graphs
Even and Odd Pairs in Comparability and in P4-comparability Graphs
Proof of conjectures on remoteness and proximity in graphs
Spectral condition for k -factor-criticality in t -connected graphs
Trivial two-stage group testing for complexes using almost disjunct matrices
Neighbour sum distinguishing total colourings via the Combinatorial Nullstellensatz
On certain classes of fractional matchings
Two-disjoint-cycle-cover edge/vertex bipancyclicity of star graphs
Scaling properties of generalized Carlitz sequences of polynomials
Local maximum stable set greedoids stemming from very well-covered graphs
A game of cops and robbers
Generalized distance spectral characterizations of graphs based on Smith Norm Form
Graphs with maximum size and given paired-domination number
Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications
Cycles embedding in balanced hypercubes with faulty edges and vertices
The Steiner ratio of high-dimensional Banach-Minkowski spaces
Fractional weak discrepancy and split semiorders
Robotic cell scheduling with operational flexibility
Optimal non-projective linear codes constructed from down-sets
Absolute algebraic connectivity of double brooms and trees
Real-time data gathering in sensor networks
Disjoint paths in sparse graphs
Identical part production in cyclic robotic cells: Concepts, overview and open questions
The disjunctive procedure and blocker duality
A note on equitable Hamiltonian cycles
Degeneracy in transportation problems
A synthesis for uniformly 3-edge-connected graphs
Compatible Euler Tours of K n **
An approximation algorithm for dissecting a rectangle into rectangles with specified areas
Restrictions and Preassignments in Preemptive open Shop Scheduling
Double domination in rooted product graphs
The interior and exterior polynomials are well-defined
Two extremal problems for 4-cycles in 4-partite graphs
Boltzmann samplers for first-order differential specifications
Maximum weight edge-constrained matchings
Self-adhesivity in lattices of abstract conditional independence models
Polyhedral results for the bipartite induced subgraph problem
On the average hitting times of the squares of cycles
Rainbow domination in the lexicographic product of graphs
On shortest crucial words avoiding abelian powers
New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints
Computing the bipartite edge frustration of fullerene graphs
Multi-terminal maximum flows in node-capacitated networks
A new measure for comparing biomedical regions of interest in segmentation of digital images
Towards optimal locality in mesh-indexings
Star-critical Ramsey numbers involving large books
Cyclotomic orthomorphisms of finite fields
Locating a discrete subtree of minimum variance on trees: New strategies to tackle a very hard problem
New classes of perfect graphs
The k-centrum Chinese Postman delivery problem and a related cost allocation game
Right angle crossing graphs and 1-planarity
A kind of conditional connectivity of transposition networks generated by k-trees
Rearrangement of DNA fragments: a branch-and-cut algorithm
Total chromatic number of unichord-free graphs
Extremal digraphs for open neighbourhood location-domination and identifying codes
Improving the lower bound on opaque sets for equilateral triangle
Metric dimension and metric independence number of incidence graphs of symmetric designs
Packing coloring of hypercubes with extended Hamming codes
Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
Energy ordering of catacondensed hexagonal systems
Maximum weight independent sets in hole- and dart-free graphs
Redicolouring digraphs: Directed treewidth and cycle-degeneracy
Codes and matrices in studies on designs
Weak connectedness of tensor product of digraphs
On the b-continuity property of graphs
Maximum eccentric connectivity index for graphs with given diameter
On the Wiener index of orientations of graphs
Coloring graphs by iterated local search traversing feasible and infeasible solutions
Achromatic number and facial achromatic number of connected locally-connected graphs
Excluding Induced Subgraphs II: Extremal Graphs
Combinatorial inversion in edge-weighted unicyclic graphs
On the further relation between the (revised) Szeged index and the Wiener index of graphs
Tropical Kirchhoff's formula and postoptimality in matroid optimization
A heuristic algorithm for rainbow matchings and its application in rainbow Ramsey number for matchings
On the facets of lift-and-project relaxations under graph operations
Paths and animals in infinite graphs with tempered degree growth
Iterative characterizations of Boolean algebras
On the Estrada index of cactus graphs
Graph products of the trivariate total domination polynomial and related polynomials
The reconstruction of a subclass of domino tilings from two projections
The Schrijver system of the length polyhedron of an interval order
The clustering coefficient of a scale-free random graph
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Misère Nim with multi-player
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem
The phase transitions of diameters in random axis-parallel hyperrectangle intersection graphs
Ferrers dimension of grid intersection graphs
Efficient algorithms for wavelength assignment on trees of rings
A note on occurrence of gapped patterns in i.i.d. sequences
Weighted distances based on neighborhood sequences for point-lattices
The average connectivity of a digraph
Ø-Threshold and Ø-Tolerance Chain Graphs
Proportionally dense subgraph of maximum size: Complexity and approximation
Correlation theorems in cryptanalysis
Learning Variable Neighborhood Search for a scheduling problem with time windows and rejections
Classes of Graphs for Which Upper Fractional Domination Equals Independence, Upper Domination, and upper Irredundance
Some subsets of points in the plane associated to truncated Reed-Muller codes with good parameters
On distance spectral radius of uniform hypergraphs with cycles
Minimum tP3-saturation graphs
Multiflows in symmetric digraphs
Tricyclic graph with maximal Estrada index
Computational complexity of isothermic DNA sequencing by hybridization
Weighted total acquisition
Properties of total domination edge-critical graphs
Well-covered graphs without cycles of lengths 4, 5 and 6
Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction
An algorithm for algebraic assignment problems
Complexity of trails, paths and circuits in arc-colored digraphs
An overview of (κ, τ)-regular sets and their applications
On the Classification of NP-complete Problems in Terms of Their Correlation Coefficient
Structural and spectral properties of corona graphs
A Decomposition Algorithm for Network Reliability Evaluation
Maximum external Wiener index of graphs
Generalization of matching extensions in graphs (II)
Graph operations characterizing rank-width
Convex generalized flows
On the number of transversals in latin squares
Matroid optimization with the interleaving of two ordered sets
Friedman numbers have density 1
General lower bounds on the query complexity within the exact learning model
The double competition number of some triangle-free graphs
On the stable b-matching problem in multigraphs
Upper bounds on the diameter of domination dot-critical graphs with given connectivity
The tree-width of C
Recognizing quasi-triangulated graphs
Note on non-separating and removable cycles in highly connected graphs
Extensive facility location problems on networks with equity measures
On the maximum number of edges in a hypergraph with given matching number
Finding cut-vertices in the square roots of a graph
Complexity of minimum irreducible infeasible subsystem covers for flow networks
Matroid optimization problems with monotone monomials in the objective
Combinatorial Algorithms on a Class of Graphs
A proof of a version of Griggs and Yeh's conjecture for L(2,1)-labeling of iterated Mycielskians
On extendibility of unavoidable sets
Capacitated Two-Parallel Machines Scheduling to Minimize Sum of Job Completion Times
Some sufficient conditions for a graph with minimum degree to be k-factor-critical
On the number of update digraphs and its relation with the feedback arc sets and tournaments
Affinity of permutations of P 2 n
Lagrangean Methods for 0-1 Quadratic Problems
The hardness of approximating the boxicity, cubicity and threshold dimension of a graph
Properties of m-bonacci-sum graphs
Bounds on Certain Multiplications of Affine Combinations
Efficient methods of calculating the number of heapable permutations
Patterns of simple gene assembly in ciliates
A computational comparison of compact MILP formulations for the zero forcing number
Cycle regular graphs need not be transitive
On the Occurrence of Null Clauses in Random Instances of Satisfiability
A constant factor approximation algorithm for boxicity of circular arc graphs
On a new code, [2 n -1, n, 2 n-1 ]
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
Triangle-free projective-planar graphs with diameter two: Domination and characterization
Worst-case performance of Wong's Steiner tree heuristic
On the hardness of short and sign-compatible circuit walks
The unit acquisition number of a graph
Generation of lower bounds for minimum span frequency assignment
Double domination in lexicographic product graphs
An Algorithm for the Class of Pure Implicational Formulas
First vs. best improvement: An empirical study
A new trust region technique for the maximum weight clique problem
Greedy flipping of pancakes and burnt pancakes
Modular periodicity of exponential sums of symmetric Boolean functions
Inducing regulation of any digraphs
Target set selection for conservative populations
Detection of the discrete convexity of polyominoes
DRL*: A hierarchy of strong block-decomposable linear relaxations for 0-1 MIPs
On the independent domination polynomial of a graph
Quadratic almost bent functions - Their partial characterization and design in the spectral domain
The Kirchhoff indices of join networks
Corrigendum to "On strongly regular signed graphs" [Discrete Applied Mathematics 271 (2019) 184-190]
Weak-odd chromatic index of special digraph classes
Strong branchwidth and local transversals
The maximum 2D subarray polytope: Facet-inducing inequalities and polyhedral computations
Complexity and approximation results for scheduling multiprocessor tasks on a ring
How to pack directed acyclic graphs into small blocks
On the complexity of cd-coloring of graphs
On the fractal structure of the rescaled evolution set of Carlitz sequences of polynomials
On a disparity between relative cliquewidth and relative NLC-width
The Erdős webgraph server
The packing chromatic number of hypercubes
A class of asymptotically optimal group screening strategies with limited item participation
Complete characterization of bicyclic graphs with minimal Kirchhoff index
The Planar Multiterminal Cut Problem
A Boolean theory of signatures for tonal scales
Sequence mixed graphs
Odd gossiping
On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
Broadcasting in DMA-Bound Bounded Degree Graphs
An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem
Several families with incomparability and complementarity conditions
An integer optimization approach for reverse engineering of gene regulatory networks
On the algorithmic complexity of k-tuple total domination