yusuke1997/dblp-id-title huggingface dataset:
Minimum work paths in elevated networks
Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
Topological properties and algorithms for two-level hypernet networks
Ranking measures for radially Moore graphs
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis
A polynomial-time algorithm to find shortest paths with recourse
Maximum flow in probabilistic graphs-the discrete case
A mean-time comparison of algorithms for the all-pairs shortest-path problem with arbitrary arc lengths
Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
Multiperiod transshipment location-allocation problem with flow synchronization under stochastic handling operations
On the complexity of resilient network design
Algorithms, Graphs, and Complexity
Preprocessing Steiner problems from VLSI layout
A demand-responsive feeder service with a maximum headway at mandatory stops
On the roots of strongly connected reliability polynomials
A competitive analysis for retransmission timeout
Generalized nash fairness solutions for bi-objective minimization problems
An O( n log n ) heuristic for steiner minimal tree problems on the euclidean metric
A survey of sequences of central subgraphs
A new algorithm for the shortest-path problem
Paired-domination in graphs
Configuration of physical distribution networks
Acceleration of cutting-plane and column generation algorithms: Applications to network design
Sensitivity analysis in stochastic flow networks using the Monte Carlo method
The node multiterminal cut polyhedron
On the edge forwarding index problem for small graphs
Network spot-checking games: Theory and application to toll enforcing in transportation networks
Network analysis for active and passive propagation models
Broadcasting in generalized chordal rings
New lower planes for the network design problem
Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
Margining option portfolios by network flows
An algorithm to solve the m × n assignment problem in expected time O ( mn log n )
Achieving feasibility for clustered traveling salesman problems using PQ-trees
Impact of knowledge on the cost of treasure hunt in trees
A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access
Tracing the characteristic curve of a quadratic black box
Single bend paths on a grid have strong helly number 4: errata atque emendationes ad "edge intersection graphs of single bend paths on a grid"
Fault-tolerant extensions of star networks
Preface: Special issue on the future of city logistics and urban mobility
Parallel NC-algorithms for multifacility location problems with mutual communication and their applications
The shortest path problem on large-scale real-road networks
Layered Graph Models for the Electric Vehicle Routing Problem With Nonlinear Charging Functions
Computer-aided interconnection routing: General survey of the state-of-the-art
Graphs with the smallest number of minimum cut sets
Edge-tenacious networks
Network design for reverse and closed-loop supply chains: An annotated bibliography of models and solution approaches
Traffic rate network tomography with higher-order cumulants
Edge-cutsets in the directed hypercube
Efficient algorithms for generalized cut-trees
Vehicle Routing Problem With Time Windows - New Valid Inequalities From Polar Duality
Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location
The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
Deterministic radio broadcasting at low cost
A study of the analysis and control of the flow of air traffic: Part I
A novel pseudo-polynomial approach for shortest path problems
A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
Speeding Up the Solution of the Site and Power Assignment Problem in Wireless Networks
On reliability in stochastic graphs
On the connectivity of semiregular cages
A solvable routing problem
Reliability evaluation and decision problems in extra stage shuffle-exchange MINs
A generalized upper bounding algorithm for multicommodity network flow problems
On the multiplication of divisions: The use of graphs for sports scheduling
Diameter vulnerability of iterated line digraphs in terms of the girth
Discounted average degree density metric and new algorithms for the densest subgraph problem
Vertex disjoint routings of cycles over tori
Additive graph spanners
Network reliability analysis: Part I
Faster parametric shortest path and minimum-balance algorithms
Incorporating dependent node damage in deterministic connectivity analysis and synthesis of networks
Efficient algorithms for minimum range cut problems
An exponential-function reduction method for block-angular convex programs
The traveling salesman problem with cumulative costs
The multifacility center problems with random demand weights
Accumulation games on graphs
Efficient communication in unknown networks
A single facility location problem on a tree with unreliable edges
The absolute center of a network
Minimizing number of wavelengths in multicast routing trees in WDM networks
On uniformly most reliable two-terminal graphs
Fault-tolerant broadcasting and gossiping in communication networks
Fixed parameter tractability of a biconnected bottleneck Steiner network problem
The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements
A quick method for finding shortest pairs of disjoint paths
Network decomposition of general financial equilibria with transaction costs
Component evolution in a secure wireless sensor network
Conditional diameter saturated graphs
On eccentric vertices in graphs
A new algorithm for general matching problems using network flow subproblems
Optimizing concurrency under Scheduling by Edge Reversal
A class of bounded approximation algorithms for graph partitioning
On some techniques useful for solution of transportation network problems
Design of fault-tolerant networks for satellites (TWTA redundancy)
Lower bounding techniques for the degree-constrained network design problem
Maximum flows in probabilistic networks
A survey of efficient reliability computation using disjoint products approach
A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
Routing past unions of disjoint linear barriers
Constructions of large planar networks with given degree and diameter
Edge-fault-tolerant pancyclicity of alternating group graphs
Minimizing drop cost for SONET/WDM networks with wavelength requirements
New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts
Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem
On stochastic spanning tree problem
The multi-integer set cover and the facility terminal cover problem
Deterministic gathering with crash faults
A flow-based ascending auction to compute buyer-optimal Walrasian prices
On the Computational Complexity of Combinatorial Problems
Dynamic vehicle routing problems: Three decades and counting
On-line connectivity algorithms
Incremental flow
Partial line directed hypergraphs
The backup 2-center and backup 2-median problems on trees
Linearized simplicial decomposition methods for computing traffic equilibria on networks
Leader election in oriented star graphs
Proximity graphs inside large weighted graphs
Optimal locations and districts of two traveling salesmen on a tree
Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques
Continuous approximation formulas for location problems
A quasi-assignment algorithm for bus scheduling
Coverings and matchings in r -partite hypergraphs
Branch decompositions and minor containment
A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
Probabilistic similarity networks
Shortest path network interdiction with asymmetric information
A note on finding optimum branchings
Region-based fault-tolerant distributed file storage system design in networks
The minimum augmentation of any graph to a K -edge-connected graph
On the fault-tolerant diameter and wide diameter of omega-connected graphs
An integer programming approach to routing in daisy networks
Approximation algorithms for channel allocation problems in broadcast networks
A tabu search heuristic for periodic and multi-depot vehicle routing problems
Mixed search number and linear-width of interval and split graphs
Minimum multiple message broadcast graphs
Fault tolerant on-board networks with priorities
The ring/ κ -rings network design problem: Model and branch-and-cut algorithm
The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case
On a capacity scaling algorithm for the constrained maximum flow problem
Large-scale local search heuristics for the capacitated vertex p-center problem
Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries
The stable marriage problem: Structure and algorithms, by Dan Gusfield and Robert Irving, The MIT Press, Cambridge, MA, 1989, 240 pp., $27.50
Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints
Integrality in the multinetwork min-cost equal-flow problem
k -Partition-based facets of the network design problem
Primal column generation framework for vehicle and crew scheduling problems
Minimal diameter double-loop networks: Dense optimal families
A branch-and-bound algorithm for the time-dependent travelling salesman problem
Link designs and probability analyses for a class of connecting networks
Determining minimal cuts with a minimal number of arcs
Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
A comparative analysis of several formulations for the generalized minimum spanning tree problem
Combinatorial optimization problems in the analysis and design of probabilistic networks
Optimal wind farm cable routing: Modeling branches and offshore transformer modules
Computing cyclic invariants for molecular graphs
Lightpath admission control and rerouting in dynamic flex-grid optical transport networks
Lower bounds for strictly fundamental cycle bases in grid graphs
On node constraint networks
Layout, Interconnection, and Placement
Balanced cable routing for offshore wind farms with obstacles
An SST-based algorithm for the steiner problem in graphs
The node-weighted steiner tree problem
Evangelism in social networks: Algorithms and complexity
A message-routing strategy for multicomputer systems
An efficient scaling procedure for gain networks
Message complexity versus space complexity in fault tolerant broadcast protocols
A Cost Function Approximation Based Large Neighborhood Search for Dynamic Medical Courier Services
Orthogonal (g, f)-factorizations in networks
Approximation algorithms for finding low-degree subgraphs
A Fix-And-Optimize Matheuristic to Solve the Location-Allocation of Vaccination Facilities: Case of Jalisco, Mexico
Characterizing stochastic flow networks using the monte carlo method
Designing optimal fault-tolerant star networks
Calculating bounds on reachability and connectedness in stochastic networks
On operating a shuttle service
Two new families of large compound graphs
The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter
Location problems with grouped structure of demand: Complexity and algorithms
A multiphase approach to the period routing problem
The swapping problem
Control of an expanding network - "An operational nightmare"
Metaheuristics for a job scheduling problem with smoothing costs relevant for the car industry
Postman tour on a graph with precedence relation on arcs
Arc routing problems: A review of the past, present, and future
Exact reliability optimization for series-parallel graphs using convex envelopes
Heuristics for the strong generalized minimum label spanning tree problem
A sufficient condition for a matrix to be totally unimodular
QUEUEING SYSTEMS, VOLUME 1: THEORY by Leonard Kleinrock John Wiley & Sons, Inc., New York, 1975, $19.95, 417 pages
Set partitioning based heuristics for interactive routing
An optimal algorithm for layered wheel floorplan designs
Linearly many faults in arrangement graphs
Hisom: Hierarchical Self-Organizing Map for Solving Multiple Traveling Salesman Problems
Graph endpoint coloring and distributed processing
Atomic Column Generation for Consensus Between Algorithms: Application to Path Computation
An infinite class of reach-preservable graphs
Optimization Algorithms for Networks and Graphs. By Edward Minieka, Marcel Dekker, Inc. New York, New York, 1978, $19.75, 356 Pages
Bicriterion discrete equilibrium network design problem
Solving the all-pair shortest path query problem on interval and circular-arc graphs
Universal minimal total dominating functions in graphs
On a conjecture of trietsch and handler on the flow-dependent steiner ratio
Independent spanning trees on folded hyper-stars
Linearly many faults in 2-tree-generated networks
Towards a theory of domination in graphs
Algorithms and complexity results for finding graphs with extremal Randić index
Generating large scale-free networks with the Chung-Lu random graph model
Single-vehicle scheduling problems with release and service times on a line
A hybrid genetic algorithm for the Hamiltonian p -median problem
Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment
A branch-and-price approach for the maximum weight independent set problem
Exact reliabilities of most reliable double-loop networks
Optimal clustering structures for hierarchical topological design of large computer networks
A new deterministic network reliability measure
Identifying critical demand scenarios for the robust capacitated network design problem using principal component analysis
Asymmetrical multiconnection three-stage clos networks
Nonoblivious 2-Opt heuristics for the traveling salesman problem
On a tree-shaped facility location problem of Minieka
Permutation layout
The greedy travelling salesman's problem
A memetic algorithm for the weighted feedback vertex set problem
A general construction for nonblocking crosstalk-free photonic switching networks
A simple method for improving the primal simplex method for the multicommodity flow problem
The Gilbert arborescence problem
Optimal power control in OFDMA cellular networks
Waste collection routing - limited multiple landfills and heterogeneous fleet
Iterative algorithms for generating minimal cutsets in directed graphs
Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem
An algorithm for the resource constrained shortest path problem
Deterministic rendezvous in networks: A comprehensive survey
Minisum multipurpose trip location problem on trees
Optimal hierarchical clustering on a graph
Determining efficient facility locations on a tree network operating as a FIFO M /G/1 queue
Minimum bandwidth problem for embedding graphs in cycles
Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete
Optimal location of a path or tree on a network with cycles
A primal-dual algorithm for the minimum average weighted length circuit problem
Finding disjoint paths with different path-costs: Complexity and algorithms
Fault-tolerant routings in chordal ring networks
Efficient path and vertex exchange in steiner tree algorithms
Operations research: Applications and algorithms , by Wayne L. Winston, Duxbury press, Boston, 1987, 1025 pages
Bounds for the general capacitated routing problem
Exact solution of the centralized network design problem on directed graphs
Large-scale zone-based evacuation planning, Part II: Macroscopic and microscopic evaluations
Implementing vehicle routing algorithms
The complexity of the network design problem
Node based compact formulations for the Hamiltonian p -median problem
Optimum steiner ratio for gradient-constrained networks connecting three points in 3-space, part II: The gradient-constraint m satisfies 1 <= m <= sqrt(3)
Preface: Special Issue on Network Optimization in Transportation, Logistics, and Industry (Part 2)
Primal simplex network codes: State-of-the-art implementation technology
Scattering number in graphs
Safe sets, network majority on weighted trees
Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey
Reliability analysis of replicated and-or graphs
Maximizing lifetime and handling reliability in wireless sensor networks
A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
An experimental study of maximum profit wavelength assignment in WDM rings
The stochastic multicommodity flow problem
The Firefighter problem: Saving sets of vertices on cubic graphs
On cut-based inequalities for capacitated network design polyhedra
Approximation algorithms for constructing wavelength routing networks
The cardinality-constrained shortest path problem in 2-graphs
Implementing an "exact" Newton method for separable convex transportation problems
Dispatching, Positioning and Routing Resources for Wildfire Initial Attack
A warehouse location-allocation bilevel problem that considers inventory policies
Hamiltonian-laceability of star graphs
A note on a generalization of eigenvector centrality for bipartite graphs and applications
Locations on time-varying networks
Models for the design and analysis of a large package sort facility
An algorithm for certain multi-commodity flow problems
Covering edges in networks
Sensitivity analysis of optimal matchings
The complexity of designing a network with minimum diameter
Cost allocation for steiner trees
Super edge connectivity properties of connected edge symmetric graphs
Mean eccentricities of de Bruijn networks
A general framework for functional networks
Fast fault-tolerant parallel communication for de bruijn and digit-exchange networks using information dispersal
Parameter estimation in a 3-parameter p-star random graph model
Domain clustering for inter-domain path computation speed-up
Transmitting on various network topologies
Fault-tolerant routings with minimum optical index
Clustering for faster network simplex pivots
On cost allocation in communication networks
Duality in Networks: Roses, Bouquets, and Cut-Sets; Trees, Forests and Polygons
Anticipation versus reactive reoptimization for dynamic vehicle routing with stochastic requests
Exact approaches to the single-source network loading problem
Heuristic Based Real-Time Train Rescheduling System
Arc tolerances in shortest path and network flow problems
Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
Mutually independent hamiltonian paths in star networks
On the diameter of the generalized undirected de Bruijn graphs UG B ( n , m ), n 2 < m <= n 3
Telecommunications network design: Technology impacts and future directions
Network topology and integral multicommodity flow problems
Encoding shortest paths in spatial networks
The degree-preserving spanning tree problem in strongly chordal and directed path graphs
Minimal broadcast networks
Integer programming formulations for the two 4-hop-constrained paths problem
Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
Lower bounds for the relative greedy algorithm for approximating Steiner trees
Multicommodity networks with resource constraints: The generalized multicommodity flow problem
Maximum independent set for intervals by divide and conquer with pruning
Seventh annual ieee computer society international conference
More reliable graphs are not always stronger
A generalization of an edge-connectivity theorem of Chartrand
Compressing grids into small hypercubes
A branch-and-price algorithm for the multivehicle covering tour problem
Continuum approximation techniques for the design of integrated package distribution systems
An optimal schedule time of a job shop-like disjunctive graph
On testing isomorphism of permutation graphs
Generalized multi-stage connection networks
A simple and fast label correcting algorithm for shortest paths
Editorial: 2021 Glover-Klingman Prize Winner
On the split reliability of graphs
Special cases of traveling salesman and repairman problems with time windows
Experimental study of speed up techniques for timetable information systems
Trees, slices, and wheels: On the floorplan area minimization problem
A shortest augmenting path method for solving minimal perfect matching problems
On d -threshold graphs and d -dimensional bin packing
Optimal routings in communication networks with linearly bounded forwarding index
Analysis of LP relaxations for multiway and multicut problems
A branch-and-cut algorithm for the pickup-and-delivery traveling salesman problem with handling costs
Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight
A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
On the relationship between dynamic Nash and instantaneous user equilibria
Total domination in graphs
Computational algorithms for closed queueing networks, by Steven C. Bruell and Gianfranco Balbo, North Holland, 1980, 190 pp. Price: $22.95
The applicability of blockchain technology in healthcare contexts to contain COVID-19 challenges
Lost in migration: document quality for batch conversion to PDF/A
LibraryThing for libraries at Claremont
Too close to lie to you: investigating availability management on multiple communication tools across different social relationships
Methods and resources to monitor internet censorship
Exploring access in the developing world: people, libraries and information technology in Morocco
Persuasive Territories in European Cultural Politics - Critical and Controlled Knowledgescapes
Cooperative visualization: a design case
Millennials and the adoption of new technologies in libraries through the diffusion of innovations process
Linking and opening vocabularies LHT special issue: Editorial
Data for the future: The German project "Co-operative development of a long-term digital information archive" (kopal)
Towards user responsive institutional repositories: a case study
Research on the influencing factors of the switching behavior of Chinese social media users: QQ transfer to WeChat
On-demand virtual research environments and the changing roles of librarians
The application of near-automated georeferencing technique to a strip of historic aerial photographs in GIS
Adoption of big data analytics for sustainability of library services in academic libraries of Pakistan
Bibliometric analyses and network mapping on the smart library in Web of Science from 2003 to 2021
A cross-sectional survey interconnecting health information seeking behavior with clinical data of type 2 diabetes mellitus patients
"To our health!" Perceived benefits offset privacy concerns in using national contact-tracing apps
"Land of the lost": a discussion of what can be preserved through digital preservation
Educating future digitizers: The Illinois Digitization Institute's Basics and Beyond digitization training program
Mapping the field: a bibliometric analysis of land use and carbon emissions (LUCE) research from 1987 to 2018
Websites for booklovers as meeting places
Digital libraries of the future - and the role of libraries
Evaluation and optimization of supply factor efficiency for public digital cultural services in China
Knowledge curation work in Wikidata WikiProject discussions
Investigating the citation advantage of author-pays charges model in computer science research: a case study of Elsevier and Springer
Who will cite you back? Reciprocal link prediction in citation networks
Snapshots of laptop use in an academic library