yusuke1997/dblp-id-title huggingface dataset:
A majorization method for localizing graph topological indices
Remoteness and distance eigenvalues of a graph
A polynomial time algorithm for the triangle packing problem on interval graphs
Free monoids and forests of rational numbers
On the Kirchhoff index of a graph and the matchings of the subdivision
One-sided terrain guarding and chordal graphs
On the size of ∃-generalized concept lattices
A note on entire choosability of plane graphs
The read once formula of a series-parallel network
A new characterization of matrices with the consecutive ones property
Resolving dominating partitions in graphs
In Memoriam Paolo M. Camerini
On the complexity of computing treelength
Sequential testing problem: A follow-up review
Directed Hypergraphs and Applications
On distance-3 matchings and induced matchings
Linear Cellular Automata, Finite Automata and Pascal's Triangle
The competition number of a graph with exactly h holes, all of which are independent
Sandwiching the (generalized) Randić index
The probabilistic approach to limited packings in graphs
Fuzzy Harsanyi solutions for fuzzy level structure games with multi weight systems
On the maximum length of coil-in-the-box codes in dimension 8
Upper bounds for constant weight and Lee codes slightly outside the plotkin range
Fixed-parameter complexity of lambda-labelings
Matrices Generated By Semilattices
Forward linearised tree pattern matching using tree pattern border array
Least-cost partition algorithms
A heuristic for cumulative vehicle routing using column generation
On the subword complexity of iteratively generated infinite words
The lower bounds of 4-tree connectivity of Cartesian product graphs
Vertex-weightings for distance moments and thorny graphs
Tridiagonal maximum-entropy sampling and tridiagonal masks
Safe sets and in-dominating sets in digraphs
A complexity theory for hard enumeration problems
MILP approach to pattern generation in logical analysis of data
Block-indifference graphs: Characterization, structural and spectral properties
Fast winning strategies for Staller in the Maker-Breaker domination game
Batch Scheduling in a Two-machine Flow Shop with Limited Buffer
On the cycling operation in braid groups
Brooks-type theorem for r-hued coloring of graphs
Extremal hypergraphs for matching number and domination number
Covering a laminar family by leaf to leaf links
Robust network optimization under polyhedral demand uncertainty is NP-hard
An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
Average time of computing Boolean operators
A large set of non-Hamiltonian graphs
On the Extension of Bipartite to Parity Graphs
A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
Graphs with integer matching polynomial zeros
Level of repair analysis and minimum cost homomorphisms of graphs
A method for computing local contributions to graph energy based on Estrada-Benzi approach
General neighborhood sequences in Z n
Forbidden subgraphs for supereulerian and hamiltonian graphs
Improved bottleneck domination algorithms
Improving Local Search Heuristics for some Scheduling Problems. Part II
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness
On a problem of cyclic permutations of integers
Counting disjoint 2-partitions for points in the plane
A characterization of trees based on edge-deletion and its applications for domination-type invariants
Connectivity and super connectivity of enhanced folded hypercube-like networks
Relating the annihilation number and the 2-domination number of block graphs
Topological sweep of the complete graph
The complexity of gerrymandering over graphs: Paths and trees
Fast gossiping with short unreliable messages
Bounds on independent isolation in graphs
Recognizing Interval Digraphs and Interval Bigraphs in Polynomial Time
A greedy algorithm for some classes of integer programs
Classification of normalized cluster methods in an order theoretic model
Lower Probabilities and Function Representation
Complexity of Grundy coloring and its variants
Lattice hypercube designs
On comparing algorithms for the maximum clique problem
A Lower Bound for the Job Insertion Problem
The generalized 4-connectivity of hypercubes
On the power of permitting features in cooperating context-free array grammar systems
Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size
The Forbidden Projections of Unate Functions
Extensions de réseaux de connexité donnée
Graph structural properties of non-Yutsis graphs allowing fast recognition
Strongly restricted permutations and tiling with fences
Simplified existence theorems for (g, f)-factors
A tree representation for P 4 -sparse graphs
A Fast Algorithm for Strongly Correlated Knapsack Problems
The shape of node reliability
A class of spectral bounds for Max k-Cut
Reverse 2-median problem on trees
Algorithms for clique-independent sets on subclasses of circular-arc graphs
Proper circular arc graphs as intersection graphs of pathson a grid
A note on the computation of the fraction of smallest denominator in between two irreducible fractions
Minimum Broadcast Digraphs
Colour degree matrices of graphs with at most one cycle
Algebraic-geometric codes and asymptotic problems
Induced forests in some distance-regular graphs
Vulnerability analysis of multiprocessor system based on burnt pancake networks
String matching with lookahead
Production planning problems in printed circuit board assembly
The characteristic polynomial of a graph containing loops
Combinatorial approach to image analysis
Maximum weight independent sets in classes related to claw-free graphs
Subtrees of Bipartite Digraphs - The Minimum Degree Condition
Polyhedral Characterizations, Perfection of Line Graphs
On the biplanar and k-planar crossing numbers
An Isomorphism Between the P-adic Integers and a Ring Associated with a Tiling of N-space By Permutohedra
A specialized branch & bound & cut for Single-Allocation Ordered Median Hub Location problems
Graphs with doubly resolving number 2
Equidistant codes in the Grassmannian
Digital straightness - a review
A simplified NP-complete satisfiability problem
Partial characterizations of circle graphs
Subclasses of k -trees: Characterization and recognition
Analysing local algorithms in location-aware quasi-unit-disk graphs
Pasting gauges II: Balls in pasted halfplanes
Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: properties and algorithms
Parameterized algorithms for the Happy Set problem
Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
Exact algorithms for dominating induced matching based on graph partition
Bernoulli polynomials and Pascal matrices in the context of Clifford analysis
A note on the strength and minimum color sum of bipartite graphs
A network theory approach to the rigidity of skeletal structures Part I. Modelling and interconnection
Overlap-free morphisms and finite test-sets
The von Neumann entropy of random multipartite graphs
Note on maximal split-stable subgraphs
k-broadcast domination and k-multipacking
The L (2, 1)-labelling of trees
Cut-threshold graphs
Clique cycle-transversals in distance-hereditary graphs
Optimal realizations and the block decomposition of a finite metric space
A note on tolerance graph recognition
Constructive extensions of two results on graphic sequences
Approximation algorithm for extracting densest subgraph over matching-like constraints
Independent distributions on a multi-branching AND-OR tree of height 2
A characterization of interval orders with semiorder dimension two
Straight line embeddings of rooted star forests in the plane
A polyhedral approach to an integer multicommodity flow problem
On the revised Szeged index
Separating objects in the plane by wedges and strips
Spanning trees of bipartite graphs with a bounded number of leaves and branch vertices
On the anti-Kekulé number and odd cycle transversal of regular graphs
Ranking and unranking restricted permutations
A recognition algorithm for adjusted interval digraphs
Simple PTAS's for families of graphs excluding a minor
On the Dimension of Projected Polyhedra
The expected values of Wiener indices in random polycyclic chains
The proper 2-connection number and size of graphs
Triangulating Graphs Without Asteroidal Triples
The Capacity of the Subarray Partial Concentrators
Cartels via the modiclus
Combinatorial Optimization: Between Practice and Theory
Maximum Number of Disjoint Paths Connecting Specified Terminals in a Graph
The complete set of minimal simple graphs that support unsatisfiable 2-CNFs
A characterization of diameter-2-critical graphs whose complements are diamond-free
A constructive enumeration of nanotube cap
Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-complete
Approximating concept stability using variance reduction techniques
The weighted coloring problem for two graph classes characterized by small forbidden induced structures
Enumeration of simple games with two equivalence classes of players
The maximum degree and diameter-bounded subgraph in the mesh
Two sensitivity theorems in fuzzy integer programming
Premature sets of 1-factors or how not to schedule round robin tournaments
Open shop scheduling problems with conflict graphs
Approximate association via dissociation
Scheduling arc maintenance jobs in a network to maximize total flow over time
Partially ordered knapsack and applications to scheduling
Preface: LAGOS'13: Seventh Latin-American Algorithms, Graphs, and Optimization Symposium, Playa del Carmen, México - 2013
Sperner type theorems with excluded subposets
On m-step competition graphs of bipartite tournaments
Recognition of q-Horn Formulae in Linear Time
S-packing chromatic vertex-critical graphs
On facial unique-maximum (edge-)coloring
Slack matrices, k-products, and 2-level polytopes
Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones
Graphs That Admit 3-to-1 or 2-to-1 Maps onto the Circle
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
Vertex partitioning problems on graphs with bounded tree width
A note on the independent domination number in graphs
Cellular automata, omegaomega-regular sets, and sofic systems
Extremal P 4 -stable graphs
A note on partitions of graphs under degree constraints
Generating Bent Sequences
The square density of words having a sequence of FS-double squares
On a conjecture for the university timetabling problem
Which distance-hereditary graphs are cover-incomparability graphs?
Conditional diagnosability of bubble-sort star graphs
A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in R2
On the Galois lattice of bipartite distance hereditary graphs
Vertex and edge Padmakar-Ivan indices of the generalized hierarchical product of graphs
Locally injective k-colourings of planar graphs
Fixed points of a random restricted growth sequence
A note on eigenvalue bounds for independence numbers of non-regular graphs
Generalized Nash Fairness Solutions for Bi-Objective Discrete Optimization: Theory and Algorithms
2-factors in 1-tough k-connected graphs with prescribed independence number
Space-time 'bonds', electromagnetism and graphs
Congruences concerning Bernoulli numbers and Bernoulli polynomials
Multiprofessor scheduling
Characterizing graphs of maximum matching width at most 2
Provably secure non-interactive key distribution based on pairings
On the weightwise nonlinearity of weightwise perfectly balanced functions
The 1-good-neighbor connectivity and diagnosability of Cayley graphs generated by complete graphs
Minimal dominating sets in interval graphs and trees
The achromatic number of the union of cycles
Representative families for matroid intersections, with applications to location, packing, and covering problems
Bounds on the spectral radius of uniform hypergraphs
A pseudo-polynomial time algorithm for solving the resource dependent assignment problem
Minimal balanced collections and their application to core stability and other topics of game theory
Optimal ordered binary decision diagrams for read-once formulas
A Genuinely Polynomial Primal Simplex Algorithm for the Assignment Problem
A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control
The rate of convergence to optimality of the LPT rule
On bent functions with some symmetric properties
Extremal double hexagonal chains with respect to k-matchings and k-independent sets
Partnership formation and multinomial values
On the star of the family of independent sets in a graph
Which tree has the smallest ABC index among trees with k leaves?
A new variant of the partitioning shortest path algorithm
on Subwords of Infinite Words
2-Connected graphs with minimum general sum-connectivity index
Asymptotically optimal algorithms for geometric Max TSP and Max m-PSP
The Monadic Second-order Logic of Graphs VI: On Several Representations of Graphs by Relational Structures
A note on the L(2, 1)-labelling problem of G(k, m)
A quick way to verify if a graph is 3-colorable
Strong tree-cographs are birkhoff graphs
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
Domination in a digraph and in its reverse
Space reduction constraints for the median of permutations problem
Integral point sets over Z n m
Shortest Shortest Path Trees of a Network
Metallic cubes are the resonance graphs of phenylenes
Polynomially determining spanning connectivity of locally connected line graphs
A note on connected dominating sets of distance-hereditary graphs
The Clar and Fries structures of a fullerene I
Bipartite permutation graphs
Polynomial size linear programs for problems in P
Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7
Light structures in 1-planar graphs with an application to linear 2-arboricity
On a conjecture of Erdös, Graham and Spencer, II
On the Splicing Operation
Algorithms for nesting with defects
A distributional study of the path edge-covering numbers for random trees
Vertex-edge domination in unit disk graphs
Total Roman domination in the lexicographic product of graphs
The Pfaffian property of Cayley graphs on dihedral groups
Relating the total {2}-domination number with the total domination number of graphs
LP-based dual bounds for the maximum quasi-clique problem
Methods and problems of communication in usual networks
Global rigidity of 2-dimensional direction-length frameworks with connected rigidity matroids
b-coloring of Kneser graphs
The query complexity of a permutation-based variant of Mastermind
Perfect and Almost Perfect Sequences
A Prospect for a General Method of Constructing t -Designs
Recent advances on two-dimensional bin packing problems
A modified greedy algorithm for dispersively weighted 3-set cover
A new approximation algorithm for the multilevel facility location problem
On n-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
On some three-color Ramsey numbers for paths
An interval convexity-based framework for multilevel clustering with applications to single-linkage clustering
Trichotomy for integer linear systems based on their sign patterns
On the readability of overlap digraphs
Lower bounds on the irregularity of trees and unicyclic graphs
Sparse Hypercube 3-spanners
Local negative circuits and fixed points in non-expansive Boolean networks
Random access to Fibonacci encoded files
On the b-chromatic number of Kneser graphs
Constant time enumeration of weighted trees
Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
The threshold order of a Boolean function
Discrete Tomography determination of bounded sets in Z n
Core-based criterion for extreme supermodular functions
A new perspective from hypertournaments to tournaments
An adaptive memory algorithm for the k-coloring problem
A new characterization of group action-based perfect nonlinearity
On fractional cut covers
Probabilities of dominant candidates based on first-place votes
Levon H. Khachatrian: 1954-2002
Perfect codes in m-Cayley hypergraphs
Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights
On dominating sets of maximal outerplanar graphs
On the transportation problem with market choice
Geometric Comparison of Combinatorial Polytopes
A local search approximation algorithm for the multiway cut problem
Complete forcing numbers of (4,6)-fullerenes
A Polynomial-time Algorithm for the Two-machine Unit-time Release-date Job-shop Schedule-length Problem
Solving Capacitated Dominating Set by using covering by subsets and maximum matching
General Randić index of unicyclic graphs with given diameter
Search ans Sweep Numbers of Finite Directed Acyclic Graphs
Two completely independent spanning trees of split graphs
Enumeration of minimal connected dominating sets for chordal graphs
Bypaths in Tournaments
Finite turns and the regular closure of linear context-free languages
Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope
On Opsut's conjecture for hypercompetition numbers of hypergraphs
On a family of universal cycles for multi-dimensional permutations
Dips at small sizes for topological graph obstruction sets
Induced cycles in triangle graphs
Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube
The Traveling Salesman Problem with flexible coloring
Skeletal configurations of ribbon trees
Size of a phylogenetic network
Broadcasting with linearly bounded transmission faults
Struction revisited
Time-stamped Graphs and Their Associated Influence Digraphs
Two easy duality theorems for product partial orders
A note on the metric and edge metric dimensions of 2-connected graphs
Upper bounds of degree 3 for the probability of the union of events via linear programming
An approximation algorithm for the partial covering 0-1 integer program
Metric properties of generalized Sierpiński graphs over stars
Geodesic pancyclicity and balanced pancyclicity of the generalized base-b hypercube
New Results in the Worst-Case Analysis for Flow-Shop Scheduling
Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
A survey on the vertex-(edge-)k-maximal graphs and the k-vertex-(edge-)connected graphs with redundant subgraphs
A characterization of P5-free graphs with a homeomorphically irreducible spanning tree
Accuracy of Techniques for the Logical Analysis of Data
An improved algorithm for the k-source maximum eccentricity spanning trees
The matching polynomial of a polygraph
A note on many-to-many matchings and stable allocations
The axiomatic characterization of the interval function of distance hereditary graphs
On regular 2-path Hamiltonian graphs
Higher Weights and Graded Rings for Binary Self-dual Codes
ℓ-distance-balanced graphs
Application of neighborhood sequences in communication of hexagonal networks
Recognizing Graphs of Acyclic Cubical Complexes
Optimal strategies for a fair betting game
Extreme Wiener indices of trees with given number of vertices of maximum degree
A system of linear equations related to the transportation problem with application to probability theory
On edge-b-critical graphs
The L(2, 1)-labeling of unigraphs
On the diameter of a domination dot-critical graph
Local edge-connectivity augmentation in hypergraphs is NP-complete
Defensive domination in proper interval graphs
Maximum 0-1 timed matching on temporal graphs
On the second-order nonlinearity of the hidden weighted bit function
On the online track assignment problem
The incidence game chromatic number of paths and subgraphs of wheels
Log-concavity, ultra-log-concavity, and a maximum entropy property of discrete compound Poisson measures
The order-preserving pattern matching problem in practice
Relaxed voting and competitive location under monotonous gain functions on trees
On decomposing a hypergraph into k connected sub-hypergraphs
(Circular) backbone colouring: Forest backbones in planar graphs
The Hamilton Cycle Problem for locally traceable and locally hamiltonian graphs
The strong metric dimension of graphs and digraphs
Conic relaxation approaches for equal deployment problems
Harmonic index of a line graph
The structure of 2-colored best match graphs
On the SPANNING k -Tree Problem
Generalized metarationalities in the graph model for conflict resolution
Minimally 3-restricted edge connected graphs
Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity
Branching in graphs and molecules
Nearly optimal codebooks based on generalized Jacobi sums
On the average hitting times of Cay(ZN,{+1,+2})
Color spanning objects: Algorithms and hardness results
Stability Number of Bull- and Chair-Free Graphs
On deciding switching equivalence of graphs
Conditional edge-fault-tolerant Hamiltonicity of the data center network
The unassigned distance geometry problem
Two more characterizations of König-Egerváry graphs
The quickest root-leaf interdiction problem on tree networks
The profile of the Cartesian product of graphs
Expanding and forwarding parameters of product graphs
Functorial scaling of ordinal data
The telephonic switching centre network problem: formalization and computational experience
A note on universal graphs for spanning trees
Weakened Gallai-Ramsey number for various graphs of order up to six
A -decomposition of tournaments and bipartite digraphs
An Efficient Preprocessing Procedure for the Multidimensional 0- 1 Knapsack Problem
The algorithmics of folding proteins on lattices
New results on word-representable graphs
Verifiable broadcasting and gossiping in communication networks
Two linear-time algorithms for computing the minimum length polygon of a digital contour
Complexity results on a paint shop problem
On reciprocal complementary Wiener number
On the hyperbolicity constant of circular-arc graphs
On Bounded-Degree Vertex Deletion parameterized by treewidth
A scheme for the synchronization of variable length codes
An approximation algorithm for zero forcing
The weak robustness of interval matrices in max-plus algebra
Complexity of list coloring problems with a fixed total number of colors
On stable assignments generated by choice functions of mixed type
Computing the expected value of invariants based on resistance distance for random spiro-polynomio chains
A branch and bound algorithm for extreme point mathematical programming problems
Characterizing and Edge-colouring Split-indifference Graphs
Bounds for boxicity of circular clique graphs and zero-divisor graphs
Characterization of minimum cycle basis in weighted partial 2-trees
Minimal elimination ordering for graphs of bounded degree
On the random version of the Erdős matching conjecture
The k-general d-position problem for graphs
The principle of valency conservation I. The skeleton influence on pericyclic reactions
On the packing chromatic number of some lattices
An improved upper bound for the neighbor sum distinguishing index of graphs
The generalized 4-connectivity of burnt pancake graphs
Residual reliability of P-threshold graphs
On the Average Steiner Distance of Graphs with Prescribed Properties
Ramsey-type theorems
The number of ribbon tilings for strips
Efficient enumeration of dominating sets for sparse graphs
On exact blockers and anti-blockers, Δ-conjecture, and related problems
Decomposing highly connected graphs into paths of length five
A proof of unimodality on the numbers of connected spanning subgraphs in an n-vertex graph with at least ... edges
The Symmetry Rule in Propositional Logic
Kempe classes and almost bipartite graphs
Recognizing vertex intersection graphs of paths on bounded degree trees
On the metric dimension of infinite graphs
Efficient enumeration of graph orientations with sources
An extension of A.R. Rao's characterization of potentially K m+1 -graphic sequences
The complexity of dissociation set problems in graphs