yusuke1997/dblp-id-title huggingface dataset:
Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates
An out-of-kilter method for submodular flows
Room allocation: a polynomial subcase of the quadratic assignment problem
Average distances and distance domination numbers
Representability of functions
The Turán number of the triangular pyramid of 3-layers
Towards a comprehensive theory of conflict-tolerance graphs
Restricted 2-extendability of (3, 6)-fullerenes
Recognizing digraphs of Kelly-width 2
The maximum α-spectral radius and the majorization theorem of k-uniform supertrees
Linear Algorithms for Preemptive Scheduling of Multiprocessor Tasks Subject to Minimal Lateness
Factorization of network reliability with perfect nodes I: Introduction and statements
A polyhedral approach to sequence alignment problems
Unary NP-hardness of transportation and batching scheduling to minimize the total weighted completion time
Path covering number and L (2, 1)L(2, 1)-labeling number of graphs
An input variable partitioning algorithm for functional decomposition of a system of Boolean functions based on the tabular method
New formulations for the Kissing Number Problem
A Linear-programming Approach to the Generalized Randic Index
Tight lower bounds on broadcast function for n=24 and 25
On the binary projective codes with dimension 6
k-restricted edge connectivity in (p+1)-clique-free graphs
Linear time algorithms for Euclidean 1-center in ℜd with non-linear convex constraints
Cooperative games on simplicial complexes
Redundant cumulative constraints to compute preemptive bounds
Minimum augmented Zagreb index of c-cyclic graphs
Structural parameterization of minus domination
Polynomial testing of the query "IS a b ≥ c d ?" with application to finding a minimal cost reliability ratio spanning tree
Reconstruction number of graphs with unique pendant vertex
Convex (0, 1)-matrices and their epitopes
Domination, independent domination, and duality in strongly chordal graphs
Insertion Techniques for the Heuristic Solution of the Job Shop Problem
Memory efficient algorithms for cactus graphs and block graphs
On saturated non-covered graphs
Further evidence towards the multiplicative 1-2-3 Conjecture
Bond Graphs II: Causality and Singularity
Maximum Estrada index of bicyclic graphs
Constructions of rotation symmetric bent functions with high algebraic degree
Nim with one or two dynamic restrictions
Scheduling groups of tasks with precedence constraints on three dedicated processors
Chordal Rings as Fault-Tolerant Loops
A Recurrence Template for Several Parameters in Series-parallel Graphs
Rainbow transitive triangles in arc-colored digraphs
Regular homogeneously traceable nonhamiltonian graphs
Approximating reversal distance for strings with bounded number of duplicates
The Shapley value on convex geometries
Complexity of Langton's ant
Maximum locally irregular induced subgraphs via minimum irregulators
AT-free graphs: linear bounds for the oriented diameter
On the degree power sum in P k -free graphs
Exact performance of MULTIFIT for nonsimultaneous machines
Quality bounds for binary tomography with arbitrary projection matrices
An infinite family of Goethals-Seidel arrays
The connectivity and the Harary index of a graph
Minimum Matrix Representation of Sperner Systems
The solution of a nonlinear partial difference equation
Asymptotic surviving rate of trees with multiple fire sources
On the rainbow planar Turán number of double stars
The Clar Covering Polynomial of Hexagonal Systems I
On the resistance diameters of graphs and their line graphs
Snarks from a Kászonyi perspective: A survey
Turán numbers and batch codes
The maximum edge biclique problem is NP-complete
The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm
The list scheduling algorithm for scheduling unreliable jobs on two parallel machines
Locating eigenvalues of matrogenic graphs in linear time
Balance, Uncorrelatedness and the Strict Avalanche Criterion
Hamiltonian claw-free graphs involving minimum degrees
Illuminating labyrinths
Uniform and monotone line sum optimization
3-Colorability in P for P 6 -free graphs
Characterizing acyclic graphs by labeling edges
Colorful linear programming, Nash equilibrium, and pivots
Partition dimension of rooted product graphs
Spanning trees with constraints on the leaf degree
Threshold-coloring and unit-cube contact representation of planar graphs
Partially unate Boolean functions: Properties of their sum-of-products representations
An improved upper bound for the acyclic chromatic number of 1-planar graphs
On the distribution of distances between specified nodes in increasing trees
Generalized travelling salesman problem through n sets of nodes: the asymmetrical case
Set-valued games and mixed-strategy equilibria in discounted supergames
Equations for the projective closure and effective Nullstellensatz
Disjoint dominating and total dominating sets in graphs
Some novel minimax results for perfect matchings of polyomino graphs
Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes
The b-Matching problem in distance-hereditary graphs and beyond
A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
The game of Cops and Robber on circulant graphs
The e-positivity and Schur positivity of some spiders and broom trees
The undirected optical indices of complete m-ary trees
Approximation algorithm for prize-collecting weighted set cover with fairness constraints
Axiomatic characterizations of generalized values
Trace-Orthogonal Normal Bases
Characterizing traces of processes defined by precedence and response constraints: An order theory approach
Rainbow spanning trees in properly coloured complete graphs
On a relation between k-path partition and k-path vertex cover
Efficient Optimal Equation Formulation in Lumped Power-conserving Systems
Surmise Relations Between Tests - Mathematical Considerations
Structure connectivity and substructure connectivity of split-star networks
On weight choosabilities of graphs with bounded maximum average degree
Matching interdiction
General properties on Sombor indices
A survey of algorithms for the single machine total weighted tardiness scheduling problem
Alternating Paths in Edge-colored Complete Graphs
A Note on Spanning Local Tournaments in Locally Semicomplete Digraphs
Enumeration and asymptotics of restricted compositions having the same number of parts
The average Laplacian polynomial of a graph
The Degree of Approximation of Sets in Euclidean Space Using Sets with Bounded Vapnik-Chervonenkis Dimension
Liar's domination in graphs: Complexity and algorithm
DP-3-coloring of planar graphs without certain cycles
How to collect balls moving in the Euclidean plane
General degree-eccentricity index of unicyclic graphs of given order, girth and maximum degree
On the connectivity and restricted edge-connectivity of 3-arc graphs
Bounded-degree light approximate shortest-path trees in doubling metrics
Two hardness results for core stability in hedonic coalition formation games
Complexity results related to monophonic convexity
Approximating the maximum 2- and 3-edge-colorable subgraph problems
Dynamic programming bi-criteria combinatorial optimization
Wiener index, Harary index and graph properties
[1, 2]-domination in graphs
On b-colorings in regular graphs
Forbidden pairs for 2-factorable and hamiltonian graphs under the necessary condition
on Reliable Graphs with Static Routing Plans
Well-indumatched Pseudoforests
The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph
Secure domination in proper interval graphs
Facets of the p-cycle polytope
On a parallel machine scheduling problem with equal processing times
Bipolar orientations Revisited
Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
Solving the integrated shipment routing problem of a less-than-truckload carrier
On two-sided Max-Linear equations
A new linear storage, polynomial-time approximation scheme for the subset-sum problem
PLA Folding in Special Graph Classes
Approximate protein folding in the HP side chain model on extended cubic lattices
On Acyclic Conjugated Molecules with Minimal Energies
V Latin-American Algorithms, Graphs, and Optimization Symposium - Gramado, Brazil, 2009
Trading properties and Alexandrov kernels for Boolean functions
Vulnerability of nearest neighbor graphs
Network flow interdiction on planar graphs
Experimental Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming
Optimally balancing assembly lines with different workstations
Ore's condition for completely independent spanning trees
Models and quantifier elimination for quantified Horn formulas
Injective chromatic index of sparse graphs
Sequential testing of complex systems: a review
A subexponential algorithm for the coloured tree partition problem
Interactive L Systems with a Fast Local Growth
Dynamically maintaining split graphs
Abelian borders in binary words
Ordinal and symbolic data analysis
On the continuity of graph parameters
On minimal coverings of the Boolean cube by centered antichains
Approximate tradeoffs on weighted labeled matroids
Connected greedy coloring of H-free graphs
Complete characterization of graphs for direct comparing Zagreb indices
On the Computational Power of DNA
Some Models for Scheduling Parallel Programs with Communication Delays
Discrete segments of Z 3 constructed by synchronization of words
An efficient algorithm for the complete set partitioning problem
On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees
About the design of oligo-chips
A new width parameter of graphs based on edge cuts: α -edge-crossing width
A note on Frank's generalized polymatroids
Kemeny's constant for a graph with bridges
On the remoteness function in median graphs
Chain method for panchromatic colorings of hypergraphs
Solving two-sided system of equations in max-plus algebra
Block coded modulation and concatenated coding schemes for error control on fading channels
Closed-form formulas for the Zhang-Zhang polynomials of benzenoid structures: Prolate rectangles and their generalizations
Information diffusion on the iterated local transitivity model of online social networks
Majority rule on rhombus tilings and Condorcet super-domains
On the structure of some classes of minimal unsatisfiable formulas
The effect of two cycles on the complexity of colourings by directed graphs
Multi-machine Scheduling with Variance Minimization
Related characterizations of the Shapley value and the weighted Shapley values via relaxations of differential marginality
Discrete tomography by convex-concave regularization and D.C. programming
(2)-pancyclic graphs
A short proof of a theorem on degree sets of graphs
Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy
Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem
A functional completeness theorem for De Morgan functions
Revising Johnson's table for the 21st century
Exponential behaviour of the Butkovic-Zimmermann algorithm for solving two-sided linear systems in max-algebra
Bipartite Graphs and Digraphs with Maximum Connectivity
Nordhaus-Gaddum-type results for monitoring edge-geodetic number of graphs
Algorithmic aspects of rotor-routing and the notion of linear equivalence
2-limited broadcast domination on grid graphs
On spanning galaxies in digraphs
Computation of Boolean functions by randomized programs
Comment on "A note on perfect lee-codes"
Second neighborhood via probabilistic argument
Lattice-theoretic properties of MPR-posets in phylogeny
A polyhedral approach for a constrained quadratic 0-1 problem
Dispersing points on intervals
Computing the eccentric-distance sum for graph operations
Two classes of edge domination in graphs
Equations enforcing repetitions under permutations
A convex polytope of diameter one
Locating a minisum circle in the plane
A note on the middle levels problem
All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
Ultrametrics, Banach's fixed point theorem and the Riordan group
Fast algorithms for min independent dominating set
Optimal partitioning of data chunks in deduplication systems
Number-theoretic interpretation and construction of a digital circle
The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks
On the affine Sylvester problem
On a Universal Chain Problem
Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index
(n,m)-graphs with maximum exponential second Zagreb index
Commutative rings with unit graphs of small vertex-arboricity
Triangle-free graphs and forbidden subgraphs
An improved ant colony optimisation heuristic for graph colouring
Sturmian graphs and integer representations over numeration systems
Permutation polytopes corresponding to strongly supermodular functions
Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concave
Constructing odd-variable RSBFs with optimal algebraic immunity, good nonlinearity and good behavior against fast algebraic attacks
Tetris-Hashing or optimal table compression
Threshold spectra via the Ehrenfeucht game
RNA pseudoknot structures with arc-length >=3 and stack-length >=sigma
An algebra for piecewise-linear minimax problems
Group testing with two defectives
Using a similarity measure for credible classification
On the extremal values of the eccentric distance sum of trees with a given domination number
Extremal length of an infinite network related to an accessible boundary point
Three supplements to Reid's theorem in multipartite tournaments
On stable cutsets in graphs
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
The q-analogue of zero forcing for certain families of graphs
Broadcasting in one dimension
Efficient parallel recognition of cographs
Edge colorings of the complete graph K149 and the lower bounds of three Ramsey numbers
A connection between circular colorings and periodic schedules
On edge colorings of graphs with no color-rich cycles
On the lifetime of a random binary sequence
Parallel Machine Scheduling to Minimize Costs for Earliness and Number of Tardy Jobs
Serial exchanges in random bases
On the smallest positive eigenvalue of bipartite graphs with a unique perfect matching
NP-completeness of Some Edge-disjoint Paths Problems
On the least eccentricity eigenvalue of graphs
Computing the minimum DNF representation of Boolean functions defined by intervals
On maximum k-edge-colorable subgraphs of bipartite graphs
Super domination: Graph classes, products and enumeration
Extremal phenylene chains with respect to the coefficients sum of the permanental polynomial, the spectral radius, the Hosoya index and the Merrifield-Simmons index
On obtaining long m-sequences from low-degree primitive polynomials
Maintaining dynamic minimum spanning trees: An experimental study
On the computational complexity of defining sets
On polyhedra induced by point sets in space
On the Complexity of Coupled-task Scheduling
An Approximation Algorithm for Scheduling on Three Dedicated Machines
On the minimum Kirchhoff index of graphs with a fixed number of cut vertices
The structure of an integral monoid and integer programming feasibility
Asymptotically optimal Gossiping in Radio Networks
Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number
The balanced maximally diverse grouping problem with attribute values
I P . L S H . D B S C A N : Integrated parallel density-based clustering by locality-sensitive hashing
Turán number of 3-free strong digraphs with out-degree restriction
Flow resistance to resistance ratios in cubic graphs
One-pass batching algorithms for the one-machine problem
Alliances in graphs of bounded clique-width
Complete oriented colourings and the oriented achromatic number
Algorithms for Weak and Wide Separation of Sets
New results on optimizing rooted triplets consistency
An improved upper bound on the queue number of the folded hypercube
Block linear majorants in quadratic 0-1 optimization
New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization
In-place algorithms for computing a largest clique in geometric intersection graphs
Computational and structural aspects of the geodetic and the hull numbers of shadow graphs
Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations
Super-connected arc-transitive digraphs
Acyclic chromatic indices of planar graphs with large girth
P 4 -domination in Minimal Imperfect Graphs
Positivity of second order linear recurrent sequences
An Extension of Elementary Bipartite Graphs to Matroid Pairs and its Characterization
Contractions in perfect graphs
Pivotal decompositions of functions
Polynomial-time approximation of largest simplices in V-polytopes
Packing and covering tetrahedra
Almost Diameter of a House-hole-free Graph in Linear Time Via LexBFS
Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
Several Classes of (2 m -1, w, 2) Optical Orthogonal Codes
Ordered biclique partitions and communication complexity problems
The weighted independent domination problem is NP-complete for chordal graphs
The clique operator on graphs with few P 4 's
Single machine scheduling with a restricted rate-modifying activity to minimize the weighted makespan
On optimization, dynamics and uncertainty: A tutorial for gene-environment networks
An algebraic and combinatorial approach to the analysis of line drawings of polyhedra
On the scramble number of graphs
Corrigendum to "Polar cographs" [Discrete Appl. Math. 156(2008) 1652-1660]
The planar Ramsey number PR(C 4 , K 8 )
Sharp bounds for the Randić index of graphs with given minimum and maximum degree
Improved approximation algorithms for cumulative VRP with stochastic demands
Upper bounds to the clique width of graphs
The state of SAT
The Wiener index of the zero-divisor graph of a finite commutative ring with unity
Induced matchings
Optimal ordering of statistically dependent tests
Discrete tomography for inscribable lattice sets
Faster optimal algorithms for segment minimization with small maximal value
On a convex operator for finite sets
On end-vertices of Lexicographic Breadth First Searches
On total f-domination: Polyhedral and algorithmic results
The Availability of Crumbling Wall Quorum Systems
Sub-trees of a random tree
A Theorem on the Principal Structure for Independent Matchings
On sequential diagnosis of multiprocessor systems
Connectivity of generalized prisms over G
The geometry of carpentry and joinery
A lower bound on the zero forcing number
Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
on ordered Graphs and Graph orderings
Strong cliques and equistability of EPT graphs
The clique-separator graph for chordal graphs
A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case
Triangulating the Surface of a Molecule
Measures on Boolean polynomials and their applications in data mining
The competition numbers of complete multipartite graphs with many partite sets
On average distance in tournaments and Eulerian digraphs
Superfluous edges and exponential expansions of De Bruijn and Kautz graphs
Compatible Hamilton Decompositions of Directed Wrapped Butterfly Graphs
Experimenting an approximation algorithm for the LCS
Tight and loose value automorphisms
Approximation Algorithms for Minimum Tree Partition
On the construction of non-2-colorable uniform hypergraphs
The upper connected geodetic number and forcing connected geodetic number of a graph
On the skewness of the join of graphs
On the upper chromatic number of (v 3 , b 2 )-configurations
Some results on chemical energy of graphs
Planar graphs without 4- and 5-cycles are acyclically 4-choosable
Lower bounds for protrusion replacement by counting equivalence classes
Matroid union - Graphic? Binary? Neither?
On the complexity of k-rainbow cycle colouring problems
Irreducibility of recombination Markov chains in the triangular lattice
The niche graphs of bipartite tournaments
Characterization of minimally t-tough, 2K2-free graphs for 1t≤2
On non-intersecting Eulerian circuits
Reinventing known results in FCA: Notes on two recently published algorithms for computation of formal concepts
Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
A note on the Clustered Set Covering Problem
An axiomatization of the median procedure on the n-cube
Multi-way sparsest cut problem on trees with a control on the number of parts and outliers
A decision algorithm for reversible pairs of polygons
Diverse data selection via combinatorial quasi-concavity of distance covariance: A polynomial time global minimax algorithm
On locally finite ordered rooted trees and their rooted subtrees
Strongly self-centered orientation of complete k-partite graphs
On approximating the b-chromatic number
Inferring a graph from path frequency
A New Version of On-line Variable-sized Bin Packing
Clique family inequalities for the stable set polytope of quasi-line graphs
A convexity upper bound for the number of maximal bicliques of a bipartite graph
On the visibility graph of convex translates
On the succinct representation of graphs
Maximal Independent Sets in Graphs with at Most One Cycle
Traces, dependency graphs and DNLC grammars
Two Strongly Polynomial Cut Cancelling Algorithms for Minimum Cost Network Flow
Some new characterizations of Hamiltonian cycles in triangular grid graphs
Relaxation procedures on graphs
On domination number and distance in graphs
Note on a Helicopter Search Problem on Graphs
Scheduling tasks with exponential duration on unrelated parallel machines
A note on large cliques in complex networks - A Ramsey theory approach
Computing a minimum paired-dominating set in strongly orderable graphs
The phylogeny number of a graph in the aspect of its triangles and diamonds
Condorcet proportions and Kelly's conjectures
Facets for single module and multi-module capacitated lot-sizing problems without backlogging
On unicyclic graphs whose second largest eigenvalue dose not exceed 1
The Laplacian spectral moments of uniform hypergraphs
The size and the spectral radius of a saturated non-covered graph
A random forest process with a variable number of giant components in the threshold window
A multiobjective optimization algorithm for the weighted LCS
Disproofs of two conjectures on no hole anti-n-labeling of graphs
The flip Markov chain for connected regular graphs
On opposition graphs, coalition graphs, and bipartite permutation graphs
Distinguishing graphs via cycles
Fast Information Sharing in a Complete Network
An improvement of sufficient condition for k-leaf-connected graphs
Proper and Unit Tolerance Graphs
On the 2-rainbow domination in graphs
Minimum k-broadcast graphs
The structure of bases in bicircular matroids
Optimal FHSs and DSSs via near zero-difference balanced functions
The random generation of Latin rectangles based on the assignment problem
Domination versus edge domination on claw-free graphs
Some remarks on graphs with no induced subdivision of K4
On the integer max-linear programming problem
Partition into almost straight trails
Partitioning a matrix with non-guillotine cuts to minimize the maximum cos
A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
A characterization of perfect Roman trees
A Map From the Lower-half of the n-cube Onto the (n-1)-cube Which Preserves Intersecting Antichains
Edge-forwarding Index of Star Graphs and Other Cayley Graphs
Practical and efficient algorithms for the geometric hitting set problem
Independence number and spectral radius of cactus graphs
Extremal families of redundantly rigid graphs in three dimensions
Signless Laplacian energy and spectral radius of a graph
On optimal piercing of a square