yusuke1997/dblp-id-title huggingface dataset:
Deterministic parameterized algorithms for the Graph Motif problem
Color-line and proper color-line graphs
An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications
A group testing method for finding patterns in data
Lower bounds for treewidth of product graphs
Local diagnosability of bipartite graphs with conditional faulty edges under Preparata, Metze and Chien's model
Preface to Special Issue on Concept Lattices and Their Applications 2016
Smallest C2ℓ+1-critical graphs of odd-girth 2k+1
On some open problems concerning quorum colorings of graphs
Piece selection algorithms for layered video streaming in P2P networks
The maximum spectral radius of graphs without a theta subgraph
Reformulation techniques in mathematical programming
A characterization of unit interval bigraphs of open and closed intervals
The minimum degree distance of graphs of given order and size
Queue layouts of iterated line directed graphs
On the path separation number of graphs
On octahedral fulleroids
A Sufficient Condition for Polynomial Distribution-dependent Learnability
Linear and nonlinear inequalities concerning a certain combinatorial sequence which arises from counting the number of chains of a finite distributive lattice
Dominating sets and domatic number of circular arc graphs
8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009)
Representations of bicircular matroids
L (2, 1)-labeling of direct product of paths and cycles
Intersection of longest paths in graph classes
Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints
Difference graphs
A computational study of f-reversible processes on graphs
Optimal parallel machines scheduling with availability constraints
A variant of k-nearest neighbors search with cyclically permuted query points for rotation-invariant image processing
On strictly chordality-k graphs
Bigraphic pairs with an A-connected realization
Merging covering arrays and compressing multiple sequence alignments
Bounds for the chromatic index of signed multigraphs
A framework for incremental generation of closed itemsets
Trees with maximum exponential Randić index
Extensions of a theorem of Balas
A shortest path-based approach to the multileaf collimator sequencing problem
Algorithms and complexity of strongly stable non-crossing matchings
End-vertices of LBFS of (AT-free) bigraphs
New bounds on the minimum density of an identifying code for the infinite hexagonal grid
A compact quadratic model and linearizations for the minimum linear arrangement problem
Planar median graphs and cubesquare-graphs
On the eccentricity spectra of threshold graphs
Rectilinear Paths Among Rectilinear Obstacles
Lower bounds on matching energy of graphs
From hypertrees to arboreal quasi-ultrametrics
Mathematical properties of the gene duplication cost
Vizing's conjecture: A two-thirds bound for claw-free graphs
Finding complementary cycles in locally semicomplete digraphs
On partitions of edge-colored graphs under color degree constraints
Approximability of guarding weak visibility polygons
The reciprocal irregularity of a graph
Structure of i-components of perfect binary codes
Decomposability of Partially Defined Boolean Functions
Forcing faces in plane bipartite graphs (II)
Computing HOMFLY polynomials of 2-bridge links from 4-plat representation
List distinguishing parameters of trees
Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs
Upper bounds for the MD-numbers and characterization of extremal graphs
The project scheduling problem with production and consumption of resources: A list-scheduling based algorithm
Combinatorics on update digraphs in Boolean networks
Generalized sequences and k-independent sets in graphs
Efficient k-shot broadcasting in radio networks
Digraphs with real and gaussian spectra
Polynomial Invariants for Trees a Statistical Mechanics Approach
A note on line broadcast in digraphs under the edge-disjoint paths mode
The b-chromatic number and related topics - A survey
On randomized broadcasting in Star graphs
Mutual transferability for (F, B, R)-domination on strongly chordal graphs and cactus graphs
Length-bounded disjoint paths in planar graphs
Bipartite completion of colored graphs avoiding chordless cycles of given lengths
Multi-player Wythoff's game and its variants
Weighted microscopic image reconstruction
Thin and Slender Languages
Two Remarks on "Expanding and Forwarding" By P. Solé
A fast algorithm for multiplying min-sum permutations
Partitioning a Matrix to Minimize the Maximum Cost
Bandwidth of the product of paths of the same length
Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words
On optimal k-fold colorings of webs and antiwebs
Corrigendum to "The lower bound of the weightwise nonlinearity profile of a class of weightwise perfectly balanced functions" [Discrete Appl. Math. 297 (2021) 60-70]
Game total domination for cyclic bipartite graphs
Wiener Number of Hexagonal Jagged-rectangles
An improved upper bound for neighbor sum distinguishing edge colorings of graphs
Exponentiality of the exchange algorithm for finding another room-partitioning
Sufficient conditions for k-leaf-connected graphs in terms of the first Zagreb index, the reciprocal degree distance and the forgotten topological index
Locating and identifying codes in circulant networks
Triangulating Multitolerance Graphs
On eccentric distance sum and minimum degree
The Cyclic Towers of Antwerpen problem - A challenging Hanoi variant
2-rainbow domination of generalized Petersen graphs P(n, 2)
Lower bounds on the pathwidth of some grid-like graphs
On induced colourful paths in triangle-free graphs
A polyhedral study of triplet formulation for single row facility layout problem
Sweeps, arrangements and signotopes
A three-person deterministic graphical game without Nash equilibria
Adynamic coloring of graphs
The height and width of bargraphs
Preface: CALDAM 2017
On the barrier graph of an arrangement of ray sensors
New lower bounds for Tverberg partitions with tolerance in the plane
Uncolorable Mixed Hypergraphs
L-polytopes and Equiangular Lines
Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
On k k-domination and j j-independence in graphs
Total domination critical and stable graphs upon edge removal
Hamiltonian properties of some compound networks
Tree- and Forest-perfect Graphs
On the LU factorization of the Vandermonde matrix
Constructing day-balanced round-robin tournaments with partitions
Investigating results and performance of search and construction algorithms for word-based LFSRs, σ-LFSRs
Some New Classes of Facets for the Equicut Polytope
Subtree isomorphism is in random NC
APN permutations on Z n and Costas arrays
On computable isomorphisms in efficient asymmetric pairing-based systems
Alignment Networks and Electrical Networks
on the Recognition of Permuted Bottleneck Monge Matrices
An approximation result for a periodic allocation problem
The hierarchical product of graphs
Polynomial transformations and data-independent neighborhood functions
Exploring the role of graph spectra in graph coloring algorithm performance
Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope
Large trees with maximal inverse sum indeg index have no vertices of degree 2 or 3
Penalty formulation for zero-one nonlinear programming
Continuous time quantum walks on graphs: Group state transfer
(2, 1)-Total labelling of outerplanar graphs
Directed graphs, decompositions, and spatial linkages
Kernels by monochromatic paths in m-colored unions of quasi-transitive digraphs
Discrete tomography determination of bounded lattice sets from four X-rays
The k-path vertex cover of rooted product graphs
The first order definability of graphs: Upper bounds for quantifier depth
Linear segmentation of discrete curves into blurred segments
New sufficient conditions for strong unimodality of multivariate discrete distributions
Transversal Partitioning in Balanced Hypergraphs
Vertices removal for feasibility of clustered spanning trees
Flexibility of planar graphs - Sharpening the tools to get lists of size four
A quadratic simplex algorithm for primal optimization over zero-one polytopes
On-line construction of compact directed acyclic word graphs
Routing permutations and 2-1 routing requests in the hypercube
On a new cyclicity measure of graphs - The global cyclicity index
Reload cost problems: minimum diameter spanning tree
Wilson's theorem for consensus functions on hierarchies
Local complexity of Boolean functions
The spanning tree congestion problem on interval graphs
Facets and facet subgraphs of symmetric edge polytopes
Explicit inverse of nonsingular Jacobi matrices
Truncated metric dimension for finite graphs
On k-rainbow domination in regular graphs
Secure aggregation of distributed information: How a team of agents can safely share secrets in front of a spy
Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph
Restricted optimal pebbling and domination in graphs
Steiner Intervals in Graphs
Existence of resolvable optimal strong partially balanced designs
An algorithm for delta-wye reduction of almost-planar graphs
On multicolour noncomplete Ramsey graphs of star graphs
Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes
Erdős-Ko-Rado theorems for a family of trees
Relating the annihilation number and the total domination number for some graphs
On the spectral radius of extended adjacency matrix of a digraph
A generalization of the zero-one principle for sorting algorithms
Minimal Vertex Separators of Chordal Graphs
Dynamic monopolies for interval graphs with bounded thresholds
Cyclic Codes of Length 2 e Over Z 4
Embedding De Bruijn, Kautz and Shuffle-exchange Networks in Books
On-line DP-coloring of graphs
On the variance of Shannon products of graphs
Optimal odd gossiping
Sufficient conditions for Hamiltonian cycles in bipartite digraphs
Linear-time generation of uniform random derangements encoded in cycle notation
Dynamic determination of variable sizes of chunks in a deduplication system
Small components in k-nearest neighbour graphs
Finitely generated distribution algebras
Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis
A note on the independence number, connectivity and k-ended tree
Polyadic codes
Loopy, Hankel, and combinatorially skew-Hankel tournaments
Log-concavity of compound distributions with applications in stochastic optimization
Fair link contributions for values of network cooperative games
Almost Hadamard matrices: The case of arbitrary exponents
Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
Corrigendum to "An algorithm to find maximum area polygons circumscribed about a convex polygon" [Discrete Appl. Math. 255 (2019) 98-108]
Half-integral Flows in a Planar Graph with Four Holes
Vector partitions, multi-dimensional Faà di Bruno formulae and generating algorithms
Aligning two fragmented sequences
A matroid generalization of theorems of Lewin and Gallai
On the Equivalence Problem of Context-free and DT0L Languages
Two-Dimensional Rectangle Packing: On-Line Methods and Results
The iterated local model for social networks
Gray code for derangements
Fringe Thickness and Maximum Path Length of Binary Trees
On self-duality of branchwidth in graphs of bounded genus
A 2/3-approximation algorithm for vertex-weighted matching
On the orderability problem for PLA folding
Efficient eight-regular circulants based on the Kronecker product
Making a C 6 -free graph C 4 -free and bipartite
Pushable chromatic number of graphs with maximum average degree at most 145
Allowable processing orders in the accelerated cascade algorithm
Bipartite Permutation Graphs with Application to the Minimum Buffer Size Problem
Best monotone degree conditions for binding number and cycle structure
On cubic rainbow domination regular graphs
A new method for solving algebraic systems of positive dimension
Heuristics and Meta-heuristics for 2-layer Straight Line Crossing Minimization
Scheduling problems for parallel dedicated machines under multiple resource constraints
Eulerian detachments with local edge-connectivity
Critical (P5, bull)-free graphs
On Complexity of Minimizing Weighted Number of Late Jobs in Unit Time Open Shops
2-Tree probe interval graphs have a large obstruction set
On coupon colorings of graphs
Tutte sets in graphs II: The complexity of finding maximum Tutte sets
Preface: Russian Translations II
Equitable colorings of hypergraphs with few edges
On an extremal problem related to a theorem of Whitney
Girth of pancake graphs
Meaningfulness of conclusions from combinatorial optimization
Games restricted by simplicial complexes and an application to vertiport cooperation
Extremal f-trees and embedding spaces for molecular graphs
Non-independent randomized rounding and coloring
Computing orbit period in max-min algebra
A Short Proof of a Conjecture on the Tr-choice Number of Even Cycles
Expanding and Forwarding
Two complexity results for the vertex coloring problem
A decomposition theory based on a dominance relation and composite jobs
Two classes of 1-resilient semi-bent functions based on disjoint linear codes
The differential of the line graph L(G)
Generalized Fitch graphs II: Sets of binary relations that are explained by edge-labeled trees
On combinatorial structures of line drawings of polyhedra
Tree t-spanners in outerplanar graphs via supply demand partition
Improved sufficient conditions for k-leaf-connected graphs
Approximation algorithms for art gallery problems in polygons
On a conjecture of the Randic index
On monophonic position sets in graphs
On the outdegree zeroth-order general Randić index of digraphs
An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays
Packing of permutations into Latin squares
Applications of Ramsey theory
Factorization of network reliability with perfect nodes II: Connectivity matrix
Riordan group involutions and the Delta-sequence
Three new upper bounds on the chromatic number
Decomposing a graph into shortest paths with bounded eccentricity
Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices
Bicolored graph partitioning, or: gerrymandering at its worst
Some relations between the irreducible polynomials over a finite field and its quadratic extension
A permutation code preserving a double Eulerian bistatistic
The Independence Number for De Bruijn networks and Kautz networks
Domination related parameters in the generalized lexicographic product of graphs
Counting inequivalent monotone Boolean functions
Randić index and coloring number of a graph
Domination in some subclasses of bipartite graphs
Resistance distance in straight linear 2-trees
On the Gowers U2 and U3 norms of Boolean functions and their restriction to hyperplanes
A note on the generalized Turán number of star forests
A hybrid and exploratory approach to knowledge discovery in metabolomic data
Computing global offensive alliances in Cartesian product graphs
Finding k-community structures in special graph classes
Bounds on the average connectivity of a graph
Approximation algorithms for some Minimum Postmen Cover Problems
Transformation completeness properties of SVPC transformation sets
A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
Families of non-IRUP instances of the one-dimensional cutting stoc problem
Weakened Ramsey Numbers
Linear Time optimization Algorithms for P4-sparse Graphs
On two conjectures concerning spanning tree edge dependences of graphs
Forcing and anti-forcing edges in bipartite graphs
An Improved Lower Bound for the Bin Packing Problem
On enumerating short projected models
Local spectra of perfect binary codes
A neighborhood union condition for fractional (a, b, k)-critical covered graphs
On the Odd Cycles of Normal Graphs
Enumeration of 2-regular circulant graphs and directed double networks
On the skewness of Cartesian products with trees
On flips in planar matchings
Scheduling under a non-reversible energy source: An application of piecewise linear bounding of non-linear demand/cost functions
Constructing depth-optimum circuits for adders and And-Or paths
Counting spanning trees of (1, N)-periodic graphs
Learning faster than promised by the Vapnik-Chervonenkis dimension
Recursive cubes of rings as models for interconnection networks
Hamiltonian laceability in hypercubes with faulty edges
Edge isoperimetric method for link fault tolerance of the complete Josephus cube under five models: A unified approach
Diagonal flips in plane graphs with triangular and quadrangular faces
Deterministic inverse zero-patterns
The crossing number of locally twisted cubes LTQn
Scheduling equal-length jobs on identical parallel machines
Finding a smallest odd hole in a claw-free graph using global structure
The complexity of generalized clique covering
On Wiener numbers of polygonal nets
Liar's dominating sets in graphs
A parallel branch and bound algorithm for the quadratic assignment problem
On structural parameterizations of load coloring
Helicopter Search Problems, Bandwidth and Pathwidth
The 0-1 inverse maximum stable set problem
On the additive complexity of a Thue-Morse-like sequence
Vertex-distinguishing proper arc colorings of digraphs
The Optimal Unicyclic Graphs for Pair-Connected Reliability
Testing the theory of evolution: A novel application of comibinatorial optimization
Construction of all tournament matrices with prescribed row sum vector
Circular vertex arboricity
Recent techniques and results on the Erdős-Pósa property
Relation between the nullity of a graph and its matching number
Coloring the square of the Kneser graph I and the Schrijver graph I
The Wiener index of the zero-divisor graph of Zn
On the combinatorics of leftist trees
Routing to reduce the cost of wavelength conversion
Chasing robbers on random geometric graphs - An alternative approach
A Lower Bound of the Expected Maximum Number of Edge-disjoint S-t Paths on Probabilistic Graphs
Some results concerning the complexity of restricted colorings of graphs
A topological sampling theorem for Robust boundary reconstruction and image segmentation
On the b-coloring of G-e
Complexity and structural results for the hull and convexity numbers in cycle convexity for graph products
Finding dominating induced matchings in S2, 2, 3-free graphs in polynomial time
Classification of rings with crosscap two class of graphs
Inverse quickest center location problem on a tree
Matrix power inequalities and the number of walks in graphs
Low complexity normal bases for F 2 mn
Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices
Distance with generalized neighbourhood sequences in n D and infinity D
Probabilities Within optimal Strategies for Tournament Games
Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words
From Logical Gates Synthesis to Chromatic Bicritical Clutters
On cocyclic weighing matrices and the regular group actions of certain paley matrices
On Probe Interval Graphs
On packing and coloring hyperedges in a cycle
Upper bounds for bar visibility of subgraphs and n-vertex graphs
Optimal quantitative group testing on cycles and paths
Skeleton matching polytope: Realization and isomorphism
An upper bound for the competition numbers of graphs
An efficient algorithm for the parametric resource allocation problem
Symmetry properties of chordal rings of degree 3
Constant threshold intersection graphs of orthodox paths in trees
The Exponent of the Primitive Cayley Digraphs on Finite Abelian Groups
Equivalent realisations of a rigid graph
A strengthened analysis of an algorithm for Dominating Set in planar graphs
Concurrency measure in commutation monoids
On computing the 2-vertex-connected components of directed graphs
A matheuristic for the asymmetric capacitated vehicle routing problem
Strong structural properties of unidirectional star graphs
Graphs with each edge in at most one maximum matching
The periodic capacitated arc routing problem with irregular services
A note on 3D orthogonal graph drawing
Steiner's Problem in Graphs: Heuristic Methods
Solving the Max-cut Problem Using Eigenvalues
Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
ToTo: An open database for computation, storage and retrieval of tree decompositions
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
Heat Conduction on Graphs
Distributivity of a segmentation lattice
On the structure of essentially-highly-connected polyhedral graphs
Forwarding index of cube-connected cycles
Linear symmetries of Boolean functions
An algorithmic characterization of antimatroids
Unlabeled compression schemes exceeding the VC-dimension
Online scheduling with general machine cost functions
Bounding the clique-width of H-free split graphs
Connected Domination and Dominating Clique in Trapezoid Graphs
The Degree/Diameter Problem for mixed abelian Cayley graphs
List Schedules for Cyclic Scheduling
Influence of the normalization constraint on the integral simplex using decomposition
Complexity of Robust Single Facility Location Problems on Networks with Uncertain Edge Lengths
On-line scheduling with precedence constraints
Some Preemptive open Shop Scheduling Problems with a Renewable or a Nonrenewable Resource. (Discrete Applied Mathematics 35 (1992) 205-219)
Algebraic Approach to Fasciagraphs and Rotagraphs
Minimum Dispersion Problems
Batch Scheduling and Common Due Date Assignment Problem: an NP-hard Case
k-edge-Hamilton-laceable bipartite graphs
Blocking zero forcing processes in Cartesian products of graphs
Adjacency on the Constrained Assignment Problem
Construction of weightwise almost perfectly balanced Boolean functions on an arbitrary number of variables
Minimum sum edge colorings of multicycles
When can Cluster Deletion with bounded weights be solved efficiently?
Error-correcting Nonadaptive Group Testing with d e -disjunct Matrices
Sandwich and probe problems for excluding paths
A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of SPLib)
The path-variance problem on tree networks
On the partial order competition dimensions of chordal graphs
Star-factors with large components, fractional k-extendability and spectral radius in graphs
Output-sensitive enumeration of maximal cliques in temporal graphs
An Enumerative Algorithm for the Frequency Assignment Problem
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
Determining equitable total chromatic number for infinite classes of complete r-partite graphs
Generating carbon nanotube caps of almost all chiralities, using six molecular segment types
On extremal unicyclic molecular graphs with maximal Hosoya index
Strong incidence coloring of outerplanar graphs
An O(n 2 ) Algorithm for Maximum Cycle Mean of Monge Matrices in Max-algebra
Selecting and covering colored points
A note on the dispersion of admissible lattices
Variance of the subgraph count for sparse Erdos-Rényi graphs
Ranking hypotheses to minimize the search cost in probabilistic inference models
On a conjecture by Sylwia Cichacz and Tomasz Hinc, and a related problem
A d-step approach to the maximum number of distinct squares and runs in strings
Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system
Classes of uniformly most reliable graphs for all-terminal reliability
Packing paths: Recycling saves time
A note on 3-bisections in subcubic graphs
On easy and hard hereditary classes of graphs with respect to the independent set problem
Spectral bounds for graph partitioning with prescribed partition sizes
A note on ordinally concave functions
Even Cycle Decompositions of index 3 by a novel coloring technique
An Adaptive Large Neighborhood Search for relocating vehicles in electric carsharing services
Proof of a conjecture on the strong chromatic index of Halin graphs
Efficient Algorithms for Minimum Weighted Colouring of Some Classes of Perfect Graphs