yusuke1997/dblp-id-title huggingface dataset:
Differentially private response mechanisms on categorical data
The Tietäväinen bound for spherical codes
A morphic representation of EOL languages and other ETOL languages
Crossing-free segments and triangles in point configurations
Edge-treewidth: Algorithmic and combinatorial properties
The 3-path-connectivity of the hypercubes
Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs
Complete characterizations of the 2-domination and P3-hull number polytopes
Solution to a conjecture on resistance diameter of lexicographic product of paths
On prescribed Hamilton laceability of hybrid-faulty star graphs
Supereulerian graphs with small circumference and 3-connected hamiltonian claw-free graphs
The 22 minimal dichotomy decompositions of the K 5 -distance
A characterization of triangle-free tolerance graphs
Integer sequence discovery from small graphs
SPLITTING NUMBER is NP-complete
Optimal strategies for selecting coordinators
Query efficient implementation of graphs of bounded clique-width
Note on fair game edge-connectivity of graphs
Graph splicing systems
Coloring Drawings of Bipartite Graphs: A Problem in Automated Assembly
Half-regular factorizations of the complete bipartite graph
Foreword: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013
Constructive dual methods for discrete programming
Exact algorithms for weak Roman domination
Decomposition of integer matrices and multileaf collimator sequencing
Characterizations of (4K1, C4, C5)-free graphs
Hereditary systems and greedy-type algorithms
A formal framework for Stringology
Planar projections of graphs
Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1-2-3 Conjecture
Refining the complexity of the sports elimination problem
Proof of a conjecture concerning maximum general sum-connectivity index χα of graphs with given cyclomatic number when 1α2
Sufficient conditions for graphs with girth g to be maximally k-restricted edge connected
The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm
On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs
An improved algorithm for finding maximum outerplanar subgraphs
Adjacency polynomials of digraph transformations
The security of all private-key bits in isogeny-based schemes
The partitioned probe problem: NP-complete versus polynomial dichotomy
Fault-tolerant strong Menger (edge) connectivity of arrangement graph
Nordhaus-Gaddum type inequality for the integer k-matching number of a graph
Complexity classification of some edge modification problems
Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs
Hamiltonian cycles in linear-convex supergrid graphs
On the minimum size of graphs with given generalized connectivity
Bisecting De Bruijn and Kautz Graphs
Arc-disjoint paths and trees in 2-regular digraphs
On some counting polynomials in chemistry
Hamiltonian colorings of graphs
Characterizing and computing minimal cograph completions
Distance edge-colourings and matchings
Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
Hard-to-color Graphs for Connected Sequential Colorings
Finding a non-minority ball with majority answers
Combinatorics of RNA Secondary Structures
l1-embeddability under the edge-gluing operation on some nonbipartite graphs
Some complexity problems on single input double output controllers
Enumeration of Clar covers of parallelogram chains
Complexity of edge monitoring on some graph classes
Orthogonal double covers of Cayley graphs
On the classification and dispersability of circulant graphs with two jump lengths
Collective additive tree spanners for circle graphs and polygonal graphs
Robustness of reliability bounds for (n,k)-star networks
Security number of grid-like graphs
Inequalities of Nordhaus-Gaddum type for doubly connected domination number
Size-optimal Boolean matrix factorization
The power of small coalitions under two-tier majority on regular graphs
Polynomial time approximation schemes and parameterized complexity
k-strong spanning local tournaments in locally semicomplete digraphs
Better Approximations of Non-Hamiltonian Graphs
There are k-uniform cubefree binary morphisms for all k>=0
Decision trees based on 1-consequences
Second-order moments of the size of randomly induced subgraphs of given order
On the hardness of the minimum height decision tree problem
A generalization of interval edge-colorings of graphs
Online maximum k-coverage
The number of rounds needed to exchange information within a graph
Degree sum condition for vertex-disjoint triangles and pentagons
Rounds in a combinatorial search problem
On point-line incidences in vector spaces over finite fields
Spans of preference functions for de Bruijn sequences
Simple Planar Graph Partition into Three Forests
On some special classes of contact B0-VPG graphs
An explicit construction of (3, t )(3, t)-existentially closed graphs
Avoidance of boxed mesh patterns on permutations
Broadcasting with random faults
Limited packings in graphs
The commutative closure of a binary slip-language is context-free: a new proof
From Ternary Strings to Wiener Indices of Benzenoid Chains
The Hosoya polynomial of distance-regular graphs
Scheduling with a discounted profit criterion on identical machines
Security in Sierpiński graphs
A lower bound on the third-order nonlinearity of the simplest PSap bent functions
Improved algorithms for several network location problems with equality measures
Selective Inheritance of Attribute Values in Relational Databases
On quintic quasi-cyclic codes
On the balanceability of some graph classes
Construction of university faculty timetables using logic programming techniques
Recognizing graphs with fixed interval number is NP-complete
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity
Computational complexity of some restricted instances of 3-SAT
Shortest-path problems and molecular conformation
On the least size of a graph with a given degree set
Mixed Interval Hypergraphs
Relative completeness with respect to two unary functions
Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
On the generality of the greedy algorithm for solving matroid base problems
(F, I)-security in graphs
Relaxation of Wegner's planar graph conjecture for maximum degree 4
A non-ambiguous decomposition of regular languages and factorizing codes
On average connectivity of the strong product of graphs
On the range of size of sum graphs & integral sum graphs of a given order
Large induced forests in planar graphs with girth 4
A note on equidistant subspace codes
On some structural properties of a subclass of ∞-regular languages
Optimization problems in multiple subtree graphs
The expected values for the Kirchhoff indices in the random cyclooctatetraene and spiro chains
Connected triangle-free m-step competition graphs
On highly palindromic words
The Time Complexity of Deterministic Broadcast Radio Networks
On regularity of languages generated by copying systems
On Hamiltonian bypasses in orgraphs with large semi-degrees
A polyhedral approach for the equitable coloring problem
Extremal values and bounds for the zero forcing number
Practical KMP/BM style pattern-matching on indeterminate strings
Almost Fully-parallel Parentheses Matching
On L(2, 1)-coloring split, chordal bipartite, and weakly chordal graphs
On the complexity of exchange-stable roommates
Independence polynomials of k-tree related graphs
Cancellation properties of products of graphs
Plane digitization and related combinatorial problems
On linear layout of bicube and construction of optimal incomplete bicube
on Some New Types of Greedy Chains and Greedy Linear Extensions of Partially ordered Sets
A Heuristic for the Two-machine Open-shop Scheduling Problem with Transportation Times
Graph partition into small cliques
Minimum-cost diagnostic strategies for k-out-of-n systems with imperfect tests
Values for level structures with polynomial-time algorithms, relevant coalition functions, and general considerations
Hamiltonian cycles in covering graphs of trees
On the 3-restricted edge connectivity of permutation graphs
On dominating sets of maximal outerplanar and planar graphs
Generalised graph colouring by a hybrid of local search and constraint programming
The absolute centre of a graph
On proper conflict-free colorings of IC-planar graphs
The Performance Ratio of Grouping Policies for the Joint Replenishment Problem
Extremal problems on ray sensor configurations
Solving the search-LWE problem over projected lattices
Injective coloring of some subclasses of bipartite graphs and chordal graphs
Kirchhoff index of composite graphs
Generalized paths and cycles in semicomplete multipartite digraphs
The complexity of cluster vertex splitting and company
Separator orders in interval, cocomparability, and AT-free graphs
An asymptotic upper bound for graph embeddings
Graphs with many edge-colorings such that complete graphs are rainbow
Linear and non-linear inequalities on the inverse sum indeg index
Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
An inequality for polymatroid functions and its applications
Strong and weak edges of a graph and linkages with the vertex cover problem
On n-fold L(j, k)-and circular L(j, k)-labelings of graphs
Minimizing irregularities in sports schedules using graph theory
Computing Prüfer codes efficiently in parallel
Upper bounds for some graph invariants in terms of blocks and cut-vertices
On the strong metric dimension of corona product graphs and join graphs
Fair multi-cake cutting
Improvements on the Johnson bound for Reed-Solomon codes
Fast Multiple Alignment of Ungapped DNA Sequences Using Information Theory and a Relaxation Method
Resistance distances and the Moon-type formula of a vertex-weighted complete split graph
Clique Cover on L-EPG representations of graphs
On the chromatic number of Toeplitz graphs
Incomplete cooperative games with player-centered information
A single machine scheduling with generalized and periodic due dates to minimize total deviation
Upper bounds on the balanced 〈r, s〉-domination number of a graph
On the complexity of the identifiable subgraph problem
Bipartite Ramsey numbers of paths for random graphs
Solving satisfiability problems using elliptic approximations - effective branching rules
Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings
An algorithmic toolbox for periodic partial words
Bond Graphs III: Bond Graphs and Electrical Networks
A parity theorem about trees with specified degrees
A note on kernels and Sperner's Lemma
Few-weight codes over Fp+uFp associated with down sets and their distance optimal Gray image
Restricted arc-connectivity of bipartite tournaments
Solving the single crane scheduling problem at rail transshipment yards
Domination cover rubbling
The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks
Ordering graphs with index in the interval (2, sqrt(2+sqrt(5)))
New results for the Longest Haplotype Reconstruction problem
Conditional matroidal edge connectivity of Cayley graphs
Broadcasting from multiple originators
Dynamic coloring parameters for graphs with given genus
Edge-grafting transformations on the average eccentricity of graphs and their applications
Maximizing Traveling Salesman Problem for Special Matrices
A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs
Bounding ℓ-edge-connectivity in edge-connectivity
0-1 multilinear programming as a unifying theory for LAD pattern generation
Domination problems with no conflicts
Locally minimal uniformly oriented shortest networks
Privileged factors in the Thue-Morse word - A comparison of privileged words and palindromes
Cyclic bandwidth with an edge added
Advances in graph drawing: The 11th International Symposium on Graph Drawing
Simple But Efficient Approaches for the Collapsing Knapsack Problem
Bond Graphs I: Acausal Equivalence
Positive matching decompositions of graphs
An algorithm to determine a path with minimal cost/capacity ratio
Functions that are uniquely maximized by sparse quasi-star graphs, and uniquely minimized by quasi-complete graphs
New bounds for Ramsey numbers R(Kk-e, Kl-e)
A Fast and Simple Steiner Routing Heuristic
Matching polynomials of two classes of graphs
The test suite generation problem: Optimal instances and their implications
Graph coloring on coarse grained multicomputers
The difficulty of beating the Taxman
Efficient Computation of Implicit Representations of Sparse Graphs
On the Kirchhoff index of bipartite graphs with given diameters
Broadcasting in Butterfly and deBruijn Networks
Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints
A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs
Alternating 6-cycles in perfect matchings of graphs representing condensed benzenoid hydrocarbons
Bounds on the complete forcing numbers of graphs
Spectra of total graphs
A relationship between Gale transforms and Voronoi diagrams
On the strong p-Helly property
Negative local feedbacks in Boolean networks
Ordered stabbing of pairwise disjoint convex sets in linear time
Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices
Unimodular functions
A closed sets based learning classifier for implicit authentication in web browsing
A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates
Scheduling cooperative gantry cranes with seaside and landside jobs
Spectral distances on graphs
Sum-perfect graphs
Minimum consistent subset of simple graph classes
Short containers in Cayley graphs
Compositions of digraphs: a survey
Some optimal combinatorial batch codes with k=5
Algorithmic enumeration of surrounding polygons
On extendibility of voltage and current regimes from subnetworks
On a class of graphs between threshold and total domishold graphs
Linear read-once and related Boolean functions
Bounds on the genus for 2-cell embeddings of prefix-reversal graphs
Laplacian Spectra and Spanning Trees of Threshold Graphs
A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
At least three minimal quasi-kernels
Advances in Discrete Geometry and Topology: Special issue devoted to the 11th International Conference on Discrete Geometry for Computer Imagery (DGCI 2003) Naples, Italy 19-21 November 2003
A remark on evolutionary systems
Maximum size of a minimum watching system and the graphs achieving the bound
Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance
The degree of functions and weights in linear codes
Minimized compact automaton for clumps over degenerate patterns
Construction of extremal mixed graphs of diameter two
Reliability assessment for modified bubble-sort networks
Locating-dominating sets in twin-free graphs
Critical Edges in Perfect Line Graphs and some Polyhedral Consequences
Graph-theoretic characterization of rings: Outer multiset dimension of zero-divisor graphs
Total rainbow k-connection in graphs
Estimation of Laplacian spectra of direct and strong product graphs
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
An algorithm for solving partial differential parametric systems
Strict 2-threshold graphs
Hyperspherical embedding of graphs and networks in communicability spaces
A successful algorithm for the undirected Hamiltonian path problem
Probability distributions for the Linux entropy estimator
A Boolean measure of similarity
Permuting Matrices to Avoid Forbidden Submatrices
Perfect k-matching, k-factor-critical and Aα-spectral radius
Sorting with networks of data structures
On the computational complexity of upper fractional domination
Finding All Common Bases in Two Matroids
Some notes on the extremal k-generalized quasi-unicyclic graphs with respect to Zagreb indices
Colouring steiner quadruple systems
Treewidth of the q-Kneser graphs
Nilpotent dynamics on signed interaction graphs and weak converses of Thomas' rules
Upper and lower bounds for competitive group testing
Systems of distant representatives
Simple image set of linear mappings in a max-min algebra
Discrete Infinite Transportation Problems
Dominating induced matchings in S1, 2, 4-free graphs
Designing PTASs for MIN-SUM scheduling problems
Perspectives of Monge Properties in Optimization
On the complexity of finding and counting solution-free sets of integers
The no-meet matroid
Structural Properties of Matroid Matchings
The price of connectivity for dominating set: Upper bounds and complexity
Travelling salesman paths on Demidenko matrices
5th Bonn workshop on combinatorial optimization : June 11-16, 1984 at the University of Bonn, West Germany
Note on Scheduling Intervals on-line
Time-tables, Polyhedra and the Greedy Algorithm
Edge coloring of signed graphs
An improved algorithm for the longest induced path problem on k-chordal graphs
Equistable chordal graphs
Maximal first Zagreb connection index of trees with given total domination number
Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids
The nonidealness index of rank-ideal matrices
Low c-differential uniformity of the swapped inverse function in odd characteristic
Minimum Wiener index of triangulations and quadrangulations
Some forbidden combinations of branches in minimal-ABC trees
Secure total domination in graphs: Bounds and complexity
A counterexample of size 20 for the problem of finding a 3-dimensional stable matching with cyclic preferences
Two-path Subsets: Efficient Counting and Applications to Performability Analysis
Decycling bubble sort graphs
Computing and counting longest paths on circular-arc graphs in polynomial time
Hamiltonian cycles and paths in faulty twisted hypercubes
Extremal k-forcing sets in oriented graphs
Weighted Harary indices of apex trees and k-apex trees
Approximation algorithms for problems in scheduling with set-ups
On the extremal graphs for general sum-connectivity index (χα) with given cyclomatic number when α>1
Decomposing toroidal graphs into circuits and edges
Decomposing split graphs into locally irregular graphs
Computing branchwidth via efficient triangulations and blocks
Generating Lower Bounds for the Linear Arrangement Problem
An efficient algorithm for the three-guard problem
Computing transitive closure of bipolar weighted digraphs
Antigenesis: A cascade-theoretical analysis of the size distributions of antigen - antibody complexes
Modelling and solving an acyclic multi-period timetabling problem
Isostatic Bar and Joint Frameworks in the Plane with Irreducible Pure Conditions
The Hamiltonian problem on distance-hereditary graphs
Fault-tolerability analysis of hypercubes based on 3-component path-structure connectivity
Antidirected hamiltonian paths between specified vertices of a tournament
Broadcast and Gossip in Line-communication Mode
Algorithms for finding a rooted (k, 1)-edge-connected orientation
A note on 1-planar graphs with minimum degree 7
Upper bound for DP-chromatic number of a graph
Hyper K1,r and sub-K1,r fault tolerance of star graphs
Scheduling with unexpected machine breakdowns
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
Weighted Connected Domination and Steiner Trees in Distance-hereditary Graphs
Packing of maximal independent mixed arborescences
On list 3-dynamic coloring of near-triangulations
Orthogonal art galleries with interior walls
Turán problem of signed graph for negative odd cycle
A family of bipartite circulant tournaments with acyclic disconnection 3
On the extreme eccentric distance sum of graphs with some given parameters
Approximation algorithms for some vehicle routing problems
Digraph matrix partitions and trigraph homomorphisms
Hyper- and reverse-Wiener indices of F-sums of graphs
Hybrid intermittent fault diagnosis of general graphs
The complexity of compressing subsegments of images described by finite automata
Commute times of random walks on trees
Algorithms for polyominoes based on the discrete Green theorem
Restricted vertex multicut on permutation graphs
On the parameterized complexity of Sparsest Cut and Small-Set Expansion problems
Noising methods for a clique partitioning problem
Cycles in the cube-connected cycles graph
On the weight and nonlinearity of homogeneous rotation symmetric Boolean functions of degree 2
On dominating sets whose induced subgraphs have a bounded diameter
Structure and dimension of the eigenspace of a concave Monge matrix
Votes and a half-binomial
An efficient distributed algorithm for canonical labeling on directed split-stars
Bounds for optimal coverings
On a labeling problem in graphs
NP-completeness of some type of p-center problem
New simple efficient algorithms computing powers and runs in strings
Compact versus noncompact LP formulations for minimizing convex Choquet integrals
Hamilton Paths in Z-transformation Graphs of Perfect Matchings of Hexagonal Systems
Generalized power domination of graphs
Adapting polyhedral properties from facility to hub location problems
Acyclic edge colouring of plane graphs
Improvements on some error-tolerance pooling designs
Four cycle decomposition of λK(n,2)
Mediated digraphs and quantum nonlocality
An Exact Method for Minimizing the Makespan of an Application Processed on a Master Slave Bus Oriented Multiprocessor System
The chromatic number of odd-hole-free graphs
The number of excellent discrete Morse functions on graphs
New comments on "A Hamilton sufficient condition for completely independent spanning tree"
Optical grooming with grooming ratio eight
Lower bounds for the geometric-arithmetic index of graphs with pendant and fully connected vertices
Geometric automorphism groups of graphs
Energy of weighted digraphs
Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees
A note on connected greedy edge colouring
A Combinatorial Approach to the Problem of Self-assembly
Extremal graphs for the geometric-arithmetic index with given minimum degree
Near-interval edge colorings of graphs
t-wise balanced designs
A note on alpha-redundant vertices in graphs
Spanning connectivity of K1,r-free split graphs
Voronoi polytopes for polyhedral norms on lattices
On null 3-hypergraphs
Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem
4-coloring (P6, bull)-free graphs
Detecting leftmost maximal periodicities
Polynomial-time algorithms for regular set-covering and threshold synthesis
Directed defective asymmetric graph coloring games
Graph operations that are good for greedoids
Positivity of third order linear recurrence sequences
The cost of perfection for matchings in graphs
Elementary matrix equivalence and core transformation graphs for Parikh matrices
On the bound for anonymous secret sharing schemes
Camel sequences and quadratic residues
Mixed integer formulations using natural variables for single machine scheduling around a common due date
Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs
On the k-Strong Roman Domination Problem
Self-inverse Sheffer sequences and Riordan involutions
Rainbow connections in digraphs
On 2-distance coloring of plane graphs with girth 5
Restricted cycle factors and arc-decompositions of digraphs
Better understanding of batcher's merging networks
Star-critical Ramsey number of F n versus K 4
Permutations of separable preference orders
Covering Italian domination in graphs
Fork-forests in bi-colored complete bipartite graphs
On extremal multiplicative Zagreb indices of trees with given number of vertices of maximum degree
On defect restricted matching extension graphs
Tight bounds on odd chromatic number of some standard graph products
Extended resolution simulates binary decision diagrams
Condorcet domains of tiling type
The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle