yusuke1997/dblp-id-title huggingface dataset:
Exact and heuristic algorithms for the green vehicle routing problem
On cycle bases with limited edge overlap
An Asymmetric Vehicle Routing Problem arising in the Collection and Disposal of Special Waste
Fleet management of autonomous vehicles: VIPAFLEET
Cycle Embedding in Alternating Group Graphs with Faulty Vertices and Faulty Edges
Equimatchable Graphs are C_2k+1-free for k ≥ 4
Fast and Simple Algorithms for Weighted Perfect Matching
Edge Coloring with Minimum Reload/Changeover Costs
Bounds and Solutions for Strategic, Tactical and Operational Ambulance Location
Virtual Private Network Design Under Traffic Uncertainty
Linear time and almost linear time cases for minimal elimination orderings
Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs
A Branch-and-Price Algorithm for Split-Coloring Problem
Binary Betting Strategies with Optimal Logarithmic Growth
c^2-join of graphs
Distribution of Permanent of Matrices with Restricted Entries over Finite Fields
12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Enschede, Netherlands, May 21-23, 2013
Bruno Simeone's Work in Clustering
1-factors and circuits of cubic graphs
A Note on the Parameterized Complexity of the Maximum Independent Set Problem
Locating Median Paths on Connected Outerplanar Graphs
On the generality of the greedy algorithm for solving matroid problems
Fault-Free Hamiltonian Cycles in Pancake Graphs with Conditional Edge Faults
Two Upper Bounds on the Chromatic Number
On minimum reload cost paths, tours and flows
Edge fault-diameter of Cartesian graph bundles
Recursive cube of rings
Combinatorial Optimization Based Recommender Systems
The spanning tree problem with one quadratic term
On Hamiltonian Cycles through Prescribed Edges of a Planar Graph
The Pickup and Delivery Problem with Incompatibility Constraints
A partial characterization by forbidden subgraphs of edge path graphs
On Deviation Measures in Stochastic Integer Programming
On specifying boundary conditions for the graph sandwich problem
On Reed's Conjecture in Triangle-Free Graphs
Fooling-sets and rank in nonzero characteristic
Coloring Graphs with Minimal Edge Load
The Complexity of Arc-coloring for Directed Hypergraphs
Approaches for optimizing cross-sell and up-sell opportunities in campaigns
Linear Time Algorithms to the Minimum All-Ones Problem for UniCyclic and Bicyclic Graphs
Two-dimensional optimal mechanism design for a single machine scheduling problem
An Application of the Sequence Dependent TSP in PCB Assembly
Most balanced minimum cuts and partially ordered knapsack
Progress on Rainbow Connection
On co-distance hereditary graphs
A 3-Approximation for the Pathwidth of Halin Graphs
Robust optimization under multiband uncertainty
Extended Distance-Hereditary Graphs
Labeling of Oriented Planar Graphs
Reformulations in Mathematical Programming: Definitions
Efficient Solution of Interval Valued Quadratic Programming Problem
On Coxeter Spectral Study of Edge-bipartite Graphs in Relation with Dynkin Diagrams
Algorithmic Solutions of Discrete Control Problems on Stochastic Networks
Exact Algorithms for a Discrete Metric Labeling Problem
The gateway location problem for hazardous material transportation
Stability of probablisitic two-stage permutation flowshop problem
A Constant Time Algorithm for Domination Problems on Polygraphs
Electric Load Forecasting: An Experimental Comparison
On Building 4-critical Plane and Projective Plane Multiwheels from Odd Wheels
Efficient Algorithms for the Double Traveling Salesman Problem with Multiple Stacks
Lower Bounds for Sizes of Semidefinite Formulations for Some Combinatorial Optimization Problems
On the intersection graphs of subspaces of a vector space
Stochastic programs with dominance contraints induced by mixed-integer linear recourse
Dominated Coloring of Graphs
Efficient Total Domination
On total coloring and equitable total coloring of cubic graphs with large girth
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs
Percolation on sparse random graphs with given degree sequence
Minimum Weighted Feedback Vertex Set on Diamonds
Combined Location and Routing Problems in Drug Distribution
GrInvIn for graph theory teaching and research
On the Cornaz-Jost Transformation to Solve the Graph Coloring Problem
Relaxed voting and competitive location on trees under monotonous gain functions
Support Vector Machines for Robust Regression
On Bipartite Graph Decomposition in the Presence of Noise, with Applications to Biological Data Clustering
Popular Ranking
The Parking Warden Tour Problem
Edge-chromatic sums of regular and bipartite graphs
Application of the descent with mutations (DWM) metaheuristic to the computation of a median equivalence relation
The Anonymous Subgraph Problem
Discounted Markov Decision Processes and Algorithms for Solving Stochastic Control Problem on Networks
On the Strongly Connected and Biconnected Components of the Complement of Graphs
A linear kernel for planar red-blue dominating set
Nash Equilibria Conditions for Stochastic Cyclic Games on Networks
Weighted Coxeter Graphs, Geometric Representation and Generalized Numbers Games
Linearization of ancestral multichromosomal genomes
Symmetry Handling via Symmetry Breaking Polytopes
A Fixed Parameter Algorithm for Plane Subgraph Completion
Pixel Guards in Polyominoes
A Matheuristic Approach for the University Carpooling Problem
The maximum labeled clique problem
Lexico-smallest Representations, Duality and Matching Polyhedra
On the cardinality constrained matroid polytope
A Particular Class of Graphic Matroids
On (P 5 , P 5 )-Sparse Graphs and other Families
On a network pricing problem with consecutive toll arcs
Snarks with Total Chromatic Number 5
Linear and cyclic distance-three labellings of trees
Integer Programming for Optimizing Salmon Farm Cage Net Use
A New TDVRP (Time Dependent Vehicle Routing Problem) Model and its Solution by Genetic Algorithm
The Kissing Number Problem: A New Result from Global Optimization
Odd cyclic surface separators in planar graphs
Improved Strategies for Branching on General Disjunctions
Chromatic Index of Chordless Graphs
Bicolored independent sets and bicliques
A Generic Framework for Approximation Analysis for Algorithms for Star Bicoloring
The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs
A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs
A Lagrangian Relaxation Approach for Gene Regulatory Networks
The Ramsey Numbers of Paths Versus Kipases
Efficient enumeration of optimal and approximate solutions of a scheduling problem
Facet-defining inequalities for the representatives k-fold coloring polytope
St-serie decomposition of orders
The Open Capacitated Arc Routing Problem
Column Generation for the Multicommodity Min-cost Flow Over Time Problem
Balanced Abelian group valued functions on directed graphs: Extended abstract
A Polynomial-Time Recursive Algorithm for some Unconstrained Quadratic Optimization Problems
Behzad-Vizing Conjecture and Cartesian Product Graphs
Optimal pebbling of grids
Minimizing the Makespan in a Robotic Cell Scheduling Problem
The Number of Excellent Discrete Morse Functions on Graphs
Optimal Robustness of Supply Chains
An Improved Local Search Algorithm for 3-SAT
Competitive Analysis of the Storage Management Problem
On the Oriented Chromatic Number of Union of Graphs
NANOCONES - A Classification Result in Chemistry
MC4, Copeland and restart probabilities
Dynamic programming for queen domination
Modeling Poset Convex Subsets
The impact of the norm on the k-Hyperplane Clustering problem: relaxations, restrictions, approximation factors, and exact formulations
Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4
Average Case Complexity of Branch-and-Bound Algorithms on Random b-ary Trees
A local tournament contains a vertex whose out-arcs are g -pancyclic
Developing an Exact Method for the Obstacle Neutralization Problem
Exact Exponential-Time Algorithms for Finding Bicliques in a Graph
Characterization of Minimum Cycle Basis in Weighted Partial 2-trees
On Cliques associated to 3-set Packing Problems
A Lower Bound for the Cutting Stock Problem with a Limited Number of Open Stacks
On f and h Triangles of a Simplicial Complex
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming
A Branch-and-Price Approach for the Partition Coloring Problem
Graph Models and their Efficient Implementation for Sparse Jacobian Matrix Determination
Stochastic bilevel network design problems
Minimum Sum Set Coloring on some Subclasses of Block Graphs
Decomposing trees with large diameter
An Assignment Problem with Compactness Requirements: Models and Algorithms
Star Bi-Coloring of Bipartite Graphs using Column Generation
On the forbidden induced subgraph probe problem
Integer Programming with 2-Variable Equations and 1-Variable Inequalities
Majority Graphs of Profiles of Equivalence Relations and Complexity of Réegnier's Problem
Increasing the Edge Connectivity by One in O(lambda_G n^2 log* n) Expected Time
Colored Trees in Edge-Colored Graphs
An Approximate Algorithm for the Chromatic Number of a Graph
On the defensive k -alliance number of a graph
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, Villa Mondragone, Frascati, Italy, June 14-16, 2011
Strategies for Single-machine Multi-agent Scheduling Problems
Distinguishing Number and Circulant Graphs
Discrepancy of Sums of Arithmetic Progressions
NP-Completeness of Determining the Total Chromatic Number of Graphs that do not Contain a Cycle with a Unique Chord
Inferring Update Sequences in Boolean Gene Regulatory Networks
Some Bounds on Alliances in Trees
New Estimations of the Gap-k-coloring Number
A Car Rental Problem at the German Bundeswehr
Online checkpointing with improved worst-case guarantees
Computing Optimal Discrete Morse Functions
Edge intersection graphs of single bend paths on a grid
An Exact Method for the Minimum Caterpillar Spanning Problem
Wide - Sense Nonblocking logd(N; 0; p) Networks
Determining Nash Equilibria for Dynamic Positional Games on Networks
Upper and Lower Bounds for the Homogeneous Areas Problem
Some flexibility problmes and their complexity
Optimising Node Coordinates for the Shortest Path Problem
Control and voting power in complex shareholding networks
Resources and transmission formats allocation in OFDMA networks
Bipartite Modularity Based Clustering for Collaborative Filtering
Computing Bounds for Eternal Domination
Generalized row family inequalities for the set covering polyhedron
Submodular Function Minimization in Zeta n and Searching in Monge arrays
Simultaneously integral graphs on three associated matrices
A Heuristic Algorithm for the Train-Unit Assignment Problem
Multiobjective hierarchical control of time-discrete systems and dtermining Stackelberg strategies
Semi-preemptive Routing on a Line
Acyclic and Frugal Colourings of Graphs
Recognition of Reducible Flow Hypergraphs
Extremal Stable Graphs
Complexity of O'Hara's Algorithm
Star-shaped mediation in influence games
Fulkerson's Conjecture and Loupekine's Snarks
Coloring of signed graphs
Graphs with certain locating-chromatic number
Decomposition method for project scheduling with adjacent resources
On the Smoothed Approximation Ratio of the 2-Opt Heuristic for the TSP
New Fully Polynomial Time Approximation Scheme for the Makespan Minimization with Positive Tails on a Single Machine with a Fixed Non-availability Interval
The Graphs of Structured Programming
Computing the differential of a graph
A Snail Heuristic for the Euclidean Traveling Salesman Problem
Abstract Flows over Time
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Enumeration of Labeled Split Graphs and Counts of Important Superclasses
UFO: Uncertainty Feature Optimization, an Implicit Paradigm for Problems with Noisy Data
Mixed Connectivity of Cartesian Graph Products and Bundles
On total chromatic number of direct product graphs
Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, University of Twente, Enschede, The Netherlands, 29-31 May, 2007
A latency problem with profits
Exact Algorithms for the Vertex Separator Problem in Graphs
On b-continuity of Distance-Hereditary Graphs
Broadcasts in Complementary Prisms
Sensor Network Localization Using Compressed Extended Kalman Filter
Special Cases of Online Parallel Job Scheduling
A hereditary view on efficient domination
An alternative proof for the constructive Asymmetric Lovász Local Lemma
On Finding a Minimum Weight Cycle Basis with Cycles of Bounded Length
Routing and Wavelength Assignment in Optical Networks by Independent Sets in Conflict Graphs
A tight bound on the number of minimal dominating sets in split graph
A Probabilistic Cellular Automata algorithm for the clique problem
Mathematical programming algorithms for spatial cloaking
The Classfication of B-perfect Graphs
A branch and price algorithm for the capacitated ring tree problem
Computing the Grothendieck constant of some graph classes
The P3-Convexity in the Complementary Prism of a Graph
A new upper bound for the traveling salesman problem in cubic graphs
Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs
A tight Analysis of Brown-Baker-Katseff Sequences for Online Strip Packing
On the Minimum and Maximum Selective Graph Coloring Problems
A Primal-Dual Method for Approximating Tree Cover with Two Weights
Maximum Probability Problem in Stochastic Programming
Decomposition of Tutte Polynomial
A characterization for jump graphs containing complementary cycles
A Branch-and-Price Algorithm for Optimal Decoding in LDPC-Based Communications
Semidenite Programming for Stochastic Wireless OFDMA Networks
Semi blowup and blowup snarks and Berge-Fulkerson Conjecture
Super Connectivity of Generalized Petersen Graphs
New Results for the Directed Network Diversion Problem
Lattice Polyhedra and Submodular Flows
On Multi-Agent Knapsack Problems
Relaxed Locally Identifying Coloring of Graphs
Matchings in balanced hypergraphs
The Multicommodity Multilevel Bottleneck Assignment Problem
Optimal bundle pricing for homogeneous items
Intermediate Trees
Some Infinite Families of Q-Integral Graphs
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009
Random Shortest Path Metrics with Applications
Diameter and Center Computations in Networks
On the Convergence of Feasibility based Bounds Tightening
A reduction algorithm for the weighted stable set problem in claw-free graphs
Incompatibility graphs and data mining
Improved Taxation Rate for Bin Packing Games
Bilevel Programming and Maximally Violated Valid Inequalities
On the Robust Knapsack Problem
On a Stochastic Knapsack Problem
On the Generation of Bicliques of a Graph
Solving Vertex Coloring Problems as Maximum Weighted Stable Set Problems
Smoothed analysis of the successive shortest path algorithm
Characterising subclasses of perfect graphs with respect to partial orders related to edge contraction
Bi-matrix Game with Random Payoffs
Cellular radio resource allocation problem
Price of Fairness for Multiagent Subset Sum Problems
Range minimization problems in path-facility location on trees
A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks
One Minimum-Cost Network Flow Problem to Identify a Graph's Connected Components
The VC-dimension of graphs with respect to k-connected subgraphs
Decomposition Methods for Stochastic Integer Programs with Dominance Constraints
Locally optimal dissimilar paths in road networks
Finding the colors of the secret in Mastermind
A Generalized Stochastic Knapsack Problem with Application in Call Admission Control
Heuristic algorithms for obtaining Polynomial Threshold Functions with low densities
On a Packet Scheduling Problem for Smart Antennas and Polyhedra Defined Circular-ones Matrices
Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, gargano, Italy, 13-15 May, 2008
Static Symmetry Breaking in Circle Packing
The Proper Interval Colored Graph Problem for Caterpillar Trees
Maintenance Resources Allocation on Power Distribution Networks with a Multi-Objective Framework
Using Latin Squares to Color Split Graphs
Maximum Profit Wavelength Assignment in WDM Rings
Multiway Cut and Integer Flow Problems in Trees
Local Computation of Vertex Colorings
Toward a precise integrality gap for triangle-free 2-matchings
On the Bi-enhancement of Chordal-bipartite Probe Graphs
Graphs in Which the Difference of the Maximum Clique Number and the Maximum Degree Is Bounded by a Constant
Recognition of certain square geometric graphs
Subdivision of the Hierarchy of H-colorable Graph Classes by Circulant Graphs
k-Piecewise Affine Model Fitting: Heuristics Based on Multiway Linear Classification
More on Orbital Matrices
Bipartite finite Toeplitz graphs
Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs
Bounds on the index of the Signless Laplacian of a graph involving the average degree of neighbors of a vertex
A (5/3 + eps)-Approximation for 2D Strip Packing
How to Hunt an Invisible Rabbit on a Graph
Effective drawing of proportional symbol maps using GRASP
Colored Independent Sets
An extension of the Collatz function
Performance guarantees for scheduling algorithms under perturbed machine speeds
Column Generation Algorithms for the Capacitated m -Ring-Star Problem
Balanced matchings, unbalanced ones and related problems
From Sainte-Laguü to Claude Berge - French Graph Theory in the Twentieth Century
Solving the Integrated Shipment Routing Problem of a LTL Carrier
Operations Research for hospital process optimization
Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract)
Heavy Cycles in k-connected Weighted Graphs
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
A branch-and-cut algorithm for the angular TSP
Hazmat transportation problem: instance size reduction through centrality erosion
Linear Visualization of a Road Coloring
Constrained Decompositions of Integer Matrices and their Applications to Intensity Modulated Radiation Therapy
The Sliding Shortest Path Algorithms
Majorization and the minimum number of dominating sets
A New Local Condition for a Graph to be Hamiltonian
On the Partition Dimension of Cartesian Product Graphs
Heuristic Solutions to a Mailroom Inserting Machine Planning Problem
Total L(2, 1)-coloring of graphs
A New Feasibility Pump-Like Heuristic for Mixed Integer Problems
Classbased Detailed Routing in VLSI Design
Searching Circulant Graphs
Rectangle Packing with Additional Restrictions
The k-Gear Composition and the Stable Set Polytope
Constructing strategies in subclasses of McNaughton games
Formulations and heuristics for the k-Piecewise Affine Model Fitting problem
Sorting Common Operations to Minimize Tardy Jobs
Exact Graph Coloring via Hybrid Approaches
Optimal paths in networks with rated transition time costs
Coloring Interval Graphs while Minimizing End-Point Number
The Game Chromatic Number of 1-Caterpillars
13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, Istanbul, Turkey, May 26-28, 2015
Representation of poly-antimatroids
Perfect digraphs and a strong perfect digraph theorem
Improved Lower Bound for Radio Number of an Arbitrary Graph
Optimal cost sharing for capacitated facility location games
On the Facial Structure of the Common Edge Subgraph polytope
Approximating Independent Set in Semi-Random Graphs
Forwarding Indices of Some Subdivision Graphs
Geodetic sets and periphery
Sparsifying Distance Matrices for Protein-Protein Structure Alignments
Network Design with Grooming Constraints
Graph products for faster separation of 1-wheel inequalities
The Demand-dependent Optimization of Regular Train Timetables
Neighbor Rupture Degree of a Graph with Maximum Connectivity
On the Complexity of Graph-Based Bounds for the Probability Bounding Problem
On Planar and Directed Multicuts with few Source-Sink Pairs
A dynamic service mechanic problem for a housing corporation
On the maximum independent set problem in subclasses of planar and more general graphs
About the b-Continuity of Graphs
Computational complexity of the average covering tree value
Enumerating all Finite Sets of Minimal Prime Extensions of Graphs
Minimum-Cost Single-Source 2-Splittable Flow
Invex Formulations of Unbounded Disjunctions
Clique, Chromatic, and Lovász Numbers of Certain Circulant Graphs
On Enumerating All Maximal Bicliques of Bipartite Graphs
Recognizing Edge-Perfect Graphs: some Polynomial Instances
Minimum Cost Noncrossing Flow Problem on a Layered Network
An IP based heuristic algorithm for the vehicle and crew scheduling pick-up and delivery problem with time windows
Submodular Function Maximization on the Bounded Integer Lattice
The valve location problem
Robustness in Train Timetabling
A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem
An Update on the Complexity of Edge-disjoint Length-equal-3 Paths Problems
Two-Levels-Greedy: A Generalized of Dijkstra's Shortest Path Algorithm
Adaptive Sampling for Embedded Software Systems Using SVM: Application to Water Level Sensors
The locating chromatic number of (n-3)-regular graphs
Covering Graphs by Colored Stable Sets
Research work with Bruno Simeone
A primal algorithm for the minimum weight clique cover problem on a class of claw-free perfect graphs
Connected dominating set in graphs without long paths and cycles
On the non-unit count of interval graphs
Dynamic Programming Algorithms for the Elementary Shortest Path Problem with Resource Constraints
On the decomposition of quaternary signed-graphic matroids
A Simple 3-Approximation of Minimum Manhattan Networks
Characterization of classical graph classes by weighted clique graphs
On a Two-Stage Stochastic Knapsack Problem with Probabilistic Constraint
Fast point-to-point shortest path queries on dynamic road networks with interfal data
Observation and evolution of finite-dimensional Markov systems
The dynamics of deterministic systems from a hypergraph theoretical point of view
A Compact Representation for Chordal Graphs
Reducing the minimum T-cut problem to polynomial size linear programming
11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Munich, Germany, May 29-31, 2012. Extended Abstracts
An Exact Algorithm to Minimize the Makespan in Project Scheduling with Scarce Resources and Feeding Precedence Relations
Manufacturing process flexibility with robust optimization using AIMMS
Determining Optimal Stationary Strategies for Discounted Stochastic Optimal Control Problem on Networks
Edge cover by bipartite subgraphs
Protein Threading
Branch-and-price for the Multi-depot Pickup and Delivery Problem with Heterogeneous Fleet and Soft Time Windows
An Application of Network Design with Orientation Constraints
Bound constraints for Point Packing in a Square
Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones
A local approximation algorithm for maximum weight matching
Classification of 0/1-Facets of the Hop Constrained Path Polytope Defined on an Acyclic Digraph
On Hamiltonian Cycles in Kneser Graphs
Approximating ( r, p )-Centroid on a Path
On full components for Rectilinear Steiner tree
Architecture Description Language for Incremental Integration of Cloud Services Architectures
Cloud compliant applications: a reference framework to assess the maturity of software applications with respect to cloud
Architectural run-time models for operator-in-the-loop adaptation of cloud applications
Processing Chains in System of Systems
A Data Platform for the Highway Traffic Data
Service-oriented toolchains for software evolution
Cloudstep: A step-by-step decision process to support legacy application migration to the cloud
Optimizing run-time SOA governance through context-driven SLAs and dynamic monitoring
Understanding Service-Oriented systems using dynamic analysis
A tool supported approach to perform efficient regression testing of web services
Platform based approach for automation of workflows in a system of systems
Smart applications on cloud infrastructure