yusuke1997/dblp-id-title huggingface dataset:
Solving Makespan Minimization Problems with Lagrangean Decomposition
Knocking out P k -free graphs
Preface: Special Issue on the Ninth International Colloquium on Graphs and Optimization (GO IX), 2014
Proof of a conjecture on the Wiener index of Eulerian graphs
The cross-correlation measure of families of finite binary sequences: Limiting distributions and minimal values
Generalized flags in finite Abelian p-groups
Complexity of finding dense subgraphs
Rainbow forest consisting of short paths in Kn
Intersection of algebraic space curves
A note on the triameter of graphs
Genetic Local Search in Combinatorial Optimization
Graphs with Most Number of Three Point Induced Connected Subgraphs
A note on list improper coloring of plane graphs
Easy computation of eccentricity approximating trees
On the broadcast independence number of caterpillars
Analysis of a multi-category classifier
Average case complexity for finite Boolean functions
Hamiltonicity of Bipartite Biclaw-free Graphs
The Northwest corner rule revisited
Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
Relations of three classes of disconnected coloring
Extension of some edge graph problems: Standard, parameterized and approximation complexity
The computational complexity of three graph problems for instances with bounded minors of constraint matrices
Bounding the size of the subgraph induced by m m vertices and extra edge-connectivity of hypercubes
A resource-frugal probabilistic dictionary and applications in bioinformatics
AVD-total-colouring of complete equipartite graphs
On factor graphs of DOL words
Graphs with two trivial critical ideals
On the size of the largest empty box amidst a point set
Anti-commutative languages and n-codes
Computing convex quadrangulations
What is the meaning of the graph energy after all?
Irredundance graphs
(k, j)-coloring of sparse graphs
On the Regularity of Languages Generated by Context-free Evolutionary Grammars
132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers
Fulkerson-covers of hypohamiltonian graphs
Unraveling the enigmatic irregular coloring of Honeycomb Networks
On infinite words generated by polynomial D0L systems. Juha Honkala
On closure operators related to maximal tricliques in tripartite hypergraphs
Matrices with Maximum Exponents in the Class of Doubly Stochastic Primitive Matrices
on the Channel Capacity of Read/write Isolated Memory
On subclasses of minimal unsatisfiable formulas
A note on cake cutting
Strictly unimodality of the probability that the binomial distribution is more than its expectation
The preclusion numbers and edge preclusion numbers in a class of Cayley graphs
Using well-solvable quadratic assignment problems for VLSI interconnect applications
On separating systems with bounded set size
Cyclability in graph classes
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
Graphs of separability at most 2
Some efficiently solvable problems over integer partition polytopes
The stable crews problem
New combinatorial interpretations of r-Whitney and r-Whitney-Lah numbers
Distance colorings of hypercubes from Z 2 Z 4 -linear codes
on the Steiner Median of a Tree
Monitoring edge-geodetic sets: Hardness and graph products
On the size of identifying codes in triangle-free graphs
Faster separation of 1-wheel inequalities by graph products
Limited visibility Cops and Robber
Executing bigraphical reactive systems
Sharing the losses of a hierarchical venture
On the log-concavity of sequences arising from integer bases
On conjecture of Merrifield-Simmons index
Spanning caterpillar in biconvex bipartite graphs
Correction to probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
Cellular automata can generate fractals
Firefighting with a distance-based restriction
Algorithms for finding a Kth best valued assignment
Monotonicity and positive invariance of linear systems over dioids
Generating non-jumping numbers recursively
Hamiltonicity of 6-connected line graphs
Surface embedding of (n, k)-extendable graphs
Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids
MAD trees and distance-hereditary graphs
Spectra of eccentricity matrices of graphs
Exact algorithms for counting 3-colorings of graphs
Strengthened bounds for the probability of k-out-of-n events
Eternal dominating sets on digraphs and orientations of graphs
A perspective on certain polynomial-time solvable classes of satisfiability
on the Equivalence of Constrained and Unconstrained Flows
A number of stable matchings in models of the Gale-Shapley type
Note on the eccentricity spectral radius of uniform hypertrees with given diameter
Results on the vertex connectivity of hypergraphs
A lower bound for secure domination number of an outerplanar graph
VF2++ - An improved subgraph isomorphism algorithm
A coloring algorithm for -free line graphs
On the complexity of constructing Golomb Rulers
Comparison between the Wiener index and the Zagreb indices and the eccentric connectivity index for trees
Spanning acyclic subdigraphs and strong t-panconnectivity of tournaments
Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs
Divisibility and coloring of some P5-free graphs
The Cardinality and Precedence Constrained Maximum Value Sub-hypergraph Problem, Its Applications
A branch-and-cut algorithm for the maximum k-balanced subgraph of a signed graph
Integral values of generating functions of recursive sequences
On rectangle intersection graphs with stab number at most two
Algorithms for media
Backbone coloring of graphs with galaxy backbones
A note on the complexity of flow-shop scheduling with deteriorating jobs
The b-branching problem in digraphs
Polynomial-time equivalences and refined algorithms for longest common subsequence variants
Sequencing by hybridization with isothermic oligonucleotide libraries
Repeated-root cyclic and negacyclic codes over a finite chain ring
Classic Squares and Broadcast Squares
Models, relaxations and exact approaches for the capacitated vehicle routing problem
Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
On finding orientations with the fewest number of vertices with small out-degree
Component edge connectivity of folded hypercube-like networks
On the enumeration of certain weighted graphs
On the perfect matching of disjoint compact sets by noncrossing line segments in R n
Efficient domination through eigenvalues
New Steiner 2-designs from old ones by paramodifications
Generating the States of a Binary Stochastic System
Finding non-minority balls with majority and plurality queries
Finding a feasible course schedule using Tabu search
Regular Coronoid Systems
Dominating Cartesian Products of Cycles
Remembering Leo Khachiyan
Optimal parallel construction of prescribed tournaments
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
Worst case analysis of a graph coloring algorithm
Parameterized clique on inhomogeneous random graphs
Complete bipartite graphs without small rainbow subgraphs
Recognition of D-dimensional Monge Arrays
On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
Locating-dominating sets in local tournaments
The dual Lovász extension operator and the Shapley extension operator for TU games
Pancyclicity of circulant digraphs
Equitable coloring of hypergraphs
Approximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs
Fault-tolerant maximal local-connectivity on Bubble-sort star graphs
The maximum common edge subgraph problem: A polyhedral investigation
On the maximum empty rectangle problem
Graph odometry
Parameterized complexity of independent set reconfiguration problems
Approximation algorithms for orthogonal line centers
Multicolor bipartite Ramsey numbers of K t, s and large K n, n
Vertex removal in biclique graphs
A conjecture on the lower bound of the signed edge domination number of 2-connected graphs
Correction of the paper "Bicyclic graphs with extremal values of PI index"
The Setup Polyhedron of Series-parallel Posets
Performance evaluation of demodulation with diversity--a combinatorial approach II: bijective methods
Accelerated algorithm for pattern detection in logical analysis of data
The intermittent diagnosability for two families of interconnection networks under the PMC model and MM* model
Signless Laplacian eigenvalues and circumference of graphs
On complexity of Minimum Leaf Out-Branching problem
On the vertex-pancyclicity of hypertournaments
New transmission irregular chemical graphs
Monge and Feasibility Sequences in General Flow Problems
A Kinetic Approach to the Random F-graph Process. Paths, Cycles and Components
On minimizing the number of ADMs in a general topology optical network
Inclusion Relations Between Some Congruences Related to the Dot-depth Hierarchy
Description-meet compatible multiway dissimilarities
A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
On some topological indices of the tensor products of graphs
Combinatorics of Boolean automata circuits dynamics
Asymptotic enumeration of perfect matchings in m-barrel fullerene graphs
Lot-size Scheduling of Two Types of Jobs on Identical Machines
On the size of minimal separators for treedepth decomposition
Generic rigidity of molecular graphs via ear decomposition
Lower bounds for the Event Scheduling Problem with Consumption and Production of Resources
A characterization of edge b-critical graphs
Counting disjoint hypercubes in Fibonacci cubes
Computing external farthest neighbors for a simple polygon
Projection and convolution operations for integrally convex functions
Well-covered triangulations: Part IV
On the structure of the inverse of non-singular unicyclic graphs
Matching preclusion for k-ary n-cubes
Induced matchings in asteroidal triple-free graphs
System of unbiased representatives for a collection of bicolorings
The influence of variables on pseudo-Boolean functions with applications to game theory and multicriteria decision making
Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang
Scaling laws for maximum coloring of random geometric graphs
Spatial pattern discovery by learning a probabilistic parametric model from multiple attributed relational graphs
Maximum weight relaxed cliques and Russian Doll Search revisited
On the complexity of recognizing directed path families
Approximating maximum edge 2-coloring in simple graphs
Sufficient conditions for properly colored C3's and C4's in edge-colored complete graphs
Optimal alphabetic binary tree for a nonregular cost function
Multiplicities of Interpoint Distances in Finite Planar Sets
On the Complexity of Postoptimality Analysis of 0/1 Programs
Borodin-Kostochka conjecture holds for K1,3¯-free graphs
An ordering theorem on the Q-spectral radius of graphs with given size and its applications
The game chromatic index of forests of maximum degree Delta>=5
Fast algorithms for indices of nested split graphs approximating real complex networks
Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
The Graovac-Pisanski index of Sierpiński graphs
The Gergonne p-pile Problem and the Dynamics of the Function x | => (x + r)/p
Fairness in graph-theoretical optimization problems
The Average Dimension of the Hull of Cyclic Codes
Recent developments on graphs of bounded clique-width
Runs in random sequences over ordered sets
Batch processing with interval graph compatibilities between tasks
On disjoint hypercubes in Fibonacci cubes
Bounds for visual cryptography schemes
Distances based on neighbourhood sequences in non-standard three-dimensional grids
Variations of cops and robbers game on grids
On the complexity of recognizing S-composite and S-prime graphs
A concise characterization of 3D simple points
Balancing signed graphs
d-minimal Languages
A simple expected running time analysis for randomized "divide and conquer" algorithms
A novel use of t-packings to construct d-disjunct matrices
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
Clustering Bipartite, Chordal Graphs: Complexity, Sequential, Parallel Algorithms
On well-covered triangulations: Part I
Clustering on k-edge-colored graphs
Finding the Pareto-optima for the total and maximum tardiness single machine problem
Hereditary classes of graphs: A parametric approach
Algorithms for finding K-best perfect matchings
Spectral extrema of graphs: Forbidden linear forests and non-bipartite graphs
On partial cubes, well-graded families and their duals with some applications in graphs
Solving the feedback vertex set problem on undirected graphs
Cycle selections
Fibonacci-run graphs I: Basic properties
An O(n2) time algorithm for the minimal permutation completion problem
The n-ary initial literal and literal shuffle
A generalization of the binary Preparata code
A correction to a result in linear programming
A note on easy and efficient computation of full abelian periods of a word
New results on two hypercube coloring problems
The Characteristic Polynomials of Modified Graphs
The number of completely different optimal identifying codes in the infinite square grid
Semidefinite programming and arithmetic circuit evaluation
A near-optimal kernel for a coloring problem
Statistical learning formulation of the DNA base-calling problem and its solution in a Bayesian EM framework
Global majority consensus by local majority polling on graphs of a given degree sequence
On (n,m)-chromatic numbers of graphs with bounded sparsity parameters
Multi-group support vector machines with measurement costs: A biobjective approach
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
Characterization of removable elements with respect to having k disjoint bases in a matroid
Periodic Gossiping in Back-to-back Trees
Arboricity: An acyclic hypergraph decomposition problem motivated by database theory
A Heuristic with Worst-case Analysis for Minimax Routing of Two Travelling Salesmen on a Tree
A universal tree-based network with the minimum number of reticulations
Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions
On gap-labellings of some families of graphs
On bandwidth-2 graphs
Popular ranking
Cycles in complementary prisms
Mean deep coalescence cost under exchangeable probability distributions
Unconditionally secure key assignment schemes
Algorithmic and explicit determination of the Lovász number for certain circulant graphs
The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms
Reliability analysis of 3-ary n-cube in terms of average degree edge-connectivity
Bernoulli matrix and its algebraic properties
On the metric dimension of line graphs
On the foundations and extremal structure of the holographic entropy cone
Resolution and binary decision diagrams cannot simulate each other polynomially
Sorting with Fixed-length Reversals
Distance-regular Cayley graphs over (pseudo-) semi-dihedral groups
Decomposition of graphs with constraint on minimum degree
Boundary-type sets in maximal outerplanar graphs
Multicommodity flows in cycle graphs
A Review of Combinatorial Problems Arising in Feedforward Neural Network Design
An approximation algorithm for scheduling dependent tasks on m processors with small communication delays
Enumeration of factors in the Thue-Morse word
Chronological rectangle digraphs which are two-terminal series-parallel
The Set of Super-stable Marriages Forms a Distributive Lattice
Disjoint isolating sets and graphs with maximum isolation number
New lower bounds for the three-dimensional finite bin packing problem
Strong rainbow connection in digraphs
Recognition of a class of unimodular functions
Vector joint majorization and generalization of Csiszár-Körner's inequality for f-divergence
On finding a cyclic tour and a vehicle loading plan yielding maximum profit
Recognition and characterization of unit interval graphs with integer endpoints
On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
On signed digraphs with all cycles negative
CPG graphs: Some structural and hardness results
Conditional k-matching preclusion for n-dimensional torus networks
A direct barter model for course add/drop process
Using graphs for some discrete tomography problems
The insulation sequence of a graph
On edge intersection graphs of paths with 2 bends
On the polyhedral structure of uniform cut polytopes
Some results on diameters of Cayley graphs
Computing graph gonality is hard
Mutual exclusion scheduling with interval graphs or related classes. Part II
ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G2-connected medians
Directed Steiner Problems with Connectivity Constraints
A convolutional-like approach to p-adic codes
Radon transforms and packings
Generalization error bounds for the logical analysis of data
Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees
Interpolation of the Discrete Logarithm in F q by Boolean Functions and by Polynomials in Several Variables Modulo a Divisor of Q-1
Testing popularity in linear time via maximum matching
Word-representability of graphs with respect to split recomposition
Minor relation for quadrangulations on the projective plane
On the combinatorial structure of a class of I shortened Hamming codes and their dual-codes
Connecting colored point sets
A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph
The packing chromatic number of the infinite square lattice is between 13 and 15
On neighborhood-Helly graphs
Linear time approximation scheme for the multiprocessor open shop problem
A qualitative analysis of I
Graph reductions, binary rank, and pivots in gene assembly
A project and lift approach for a 2-commodity flow relocation model in a time expanded network
From modular decomposition trees to rooted median graphs
A note on M-convex functions on jump systems
Antimagic labeling for subdivisions of graphs
Simplified existence theorems on all fractional [ a , b ][a, b]-factors
On the range maximum-sum segment query problem
Linear Time Algorithms for the Weighted Tailored 2-Partition Problem and the Weighted 2-Center Problem under l infty -Distance
Measure Theoretic Approach to the Classification of Cellular Automata
Embedding various cycles with prescribed paths into k-ary n-cubes
How to build a graph in n days: Some variations of graph assembly
Almost resolvable perfect Mendelsohn designs with block size five
Balanced and 1-balanced graph constructions
Simploidals sets: Definitions, operations and comparison with simplicial sets
Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
Recognition of quasi-Meyniel graphs
Expected number of breakpoints after t random reversals in genomes with duplicate genes
Algorithms and obstructions for linear-width and related search parameters
Scaling matrices and counting the perfect matchings in graphs
All-to-all Personalized Communication on Multistage Interconnection Networks
An introduction to the analysis of approximation algorithms
Non-adaptive Group Testing in the Presence of Errors
Complexity Analysis of Propositional Resolution with Autarky Pruning
A system-theoretic model for cooperation, interaction and allocation
The graph spectra and spectral moments of random graphs
Extremal problems on consecutive L(2, 1)-labelling
On the variable Wiener-Szeged inequality
A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions
Some graphs determined by their Aα-spectra
Better Bounds for Perpetual Gossiping
A linear-time algorithm for finding an edge-partition with max-min ratio at most two
Attacking a public key cryptosystem based on tree replacement
On the vertices belonging to all edge metric bases
Cycle Kronecker products that are representable as optimal circulants
Further analysis of bent functions from C and D which are provably outside or inside M#
Equivalent versions of group-connectivity theorems and conjectures
Expected worst-case partial match in random quadtries
Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials
On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent
Disjunctive analogues of submodular and supermodular pseudo-Boolean functions
Optimal Wavelength-routed Multicasting
A note on obtaining bipartite radio graceful graphs of arbitrarily large radio numbers with radio graceful complements
List injective edge-coloring of subcubic graphs
Domination versus disjunctive domination in trees
Probabilistic analysis of the subset-sum problem
The Shields-Harary numbers of K m, n for continuous concave cost functions vanishing at 1
Minimizing the number of tardy job units under release time constraints
Color groups
Transportation in graphs and the admittance spectrum
Graph connectivity and its augmentation: applications of MA orderings
The majority game with an arbitrary majority
The Capacitated Orienteering Problem
The sandpile group of a polygon flower
Supereulerian graphs in the graph family C 2 (6, k)
The anti-adjacency matrix of a graph: Eccentricity matrix
On the Nonexistence of Extremal Self-dual Codes
A mathematical programming model for the long term development of an off-shore gas field
A heuristic approach for searching (d, n)-packing colorings of infinite lattices
Distance-two labelings of digraphs
Pancyclic graphs and degree sum and neighborhood union involving distance two
On the Aα-index of graphs with given order and dissociation number
Switchdec Polyhedra
Edge decomposition of connected claw-free cubic graphs
Efficient generation of rotating workforce schedules
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
Separability by two lines and by nearly straight polygonal chains
Knots in random walks
On the degree distance of a graph
Some remarks on interval colorings of complete tripartite and biregular graphs
A structural theorem for planar graphs with some applications
Minimum cost open chain reconfiguration
Greedy approaches for a class of nonlinear Generalized Assignment Problems
Most reliable graphs with reduced corank
Planar graphs without short even cycles are near-bipartite
On exponential type sequences
On robust identification in the square and king grids
A smaller extended formulation for the odd cycle inequalities of the stable set polytope
A quasi-quadratic vertex-kernel for Cograph Edge Editing
Least and most colored bases
Non-approximability of precedence-constrained sequencing to minimize setups
Optimal algorithms for constructing knight's tours on arbitrary n ? m chessboards
Study on geometric-arithmetic, arithmetic-geometric and Randić indices of graphs
Matching-star Ramsey Sets
Parallel algorithms for enumerating closed patterns from multi-relational data
Priority-based bin packing with subset constraints
Pancyclicity of k-ary n-cube networks with faulty vertices and edges
Principal structure of layered mixed matrices
Upper bounds for stabbing simplices by a line
An algebraic expression of the number partitioning problem
Searching for a minimal solution subgraph in explicit AND/OR graphs
The permutahedron of series-parallel posets
Independent vertex sets in the Zykov sum
Student-project allocation with preferences over projects: Algorithmic and experimental results
Connected realizations of joint-degree matrices
A Strongly Polynomial Algorithm for the Uniform Balanced Network Flow Problem
Digraph searching, directed vertex separation and directed pathwidth
Construction of universal one-way hash functions: Tree hashing revisited
Parallel token swapping for qubit routing
Defining families of trees with E0L grammars
Stable Sets in Certain P 6 -free Graphs
New results for the Mondrian art problem
On the geometry of graph spaces
On Minimum Intersection of Two Minimum Dominating Sets of Interval Graphs