On the public citation graph
A Theorem on Graphs, with an Application to a Problem of Traffic Control
0 signed · 318 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4474614openalex-extracted
On Orientations Maximizing Total Arc-Connectivity
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199901)33:1<57::aid-net4>3.0.co;2-ropenalex-snapshot
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199603)8:2<121::aid-rsa3>3.0.co;2-#openalex-snapshot
A random bit‐flipping method for seeking agreement
inferred← citeshttps://doi.org/10.1002/jgt.10160openalex-snapshot
Complexity of approximating the oriented diameter of chordal graphs
inferred← citeshttps://doi.org/10.1002/jgt.20158openalex-snapshot
Two‐connected orientations of Eulerian graphs
inferred← citeshttps://doi.org/10.1002/jgt.22181openalex-snapshot
Oriented diameter of graphs with given maximum degree
inferred← citeshttps://doi.org/10.1002/jgt.22707openalex-snapshot
Oriented diameter of maximal outerplanar graphs
inferred← citeshttps://doi.org/10.1002/jgt.22941openalex-snapshot
Improved bounds for the oriented radius of mixed multigraphs
inferred← citeshttps://doi.org/10.1002/jgt.23290openalex-snapshot
On the Minimum Number of Inversions to Make a Digraph k‐(Arc‐)Strong
inferred← citeshttps://doi.org/10.1002/jgt.3190030304openalex-snapshot
The graphs for which all strong orientations are hamiltonian
inferred← citeshttps://doi.org/10.1002/jgt.3190190405openalex-snapshot
Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
inferred← citeshttps://doi.org/10.1002/jgt.70009openalex-snapshot
A Note on Improved Bounds for the Oriented Radius of Mixed Multigraphs
inferred← citeshttps://doi.org/10.1002/jgt.70123openalex-snapshot
A Quadratic Upper Bound for the Maximum Oriented Diameter With Leading Constant 1
inferred← citeshttps://doi.org/10.1002/mana.19790930116openalex-snapshot
Eine Reduktionsmethode für den Kantenzusammenhang in Graphen
inferred← citeshttps://doi.org/10.1002/net.20358openalex-snapshot
A branch‐and‐cut‐and‐price algorithm for vertex‐biconnectivity augmentation
inferred← citeshttps://doi.org/10.1002/net.21623openalex-snapshot
Graph orientation and flows over time
inferred← citeshttps://doi.org/10.1002/net.3230080407openalex-snapshot
Graphs as mathematical models by Gary Chartrand, Prindle, Weber & Schmidt, Inc. Boston, Massachusetts 1977, $15.50, 294 pages
inferred← citeshttps://doi.org/10.1002/net.3230150409openalex-snapshot
Strongly connected orientations of mixed multigraphs
inferred← citeshttps://doi.org/10.1002/net.3230160206openalex-snapshot
Underlying properties of oriented graphs
inferred← citeshttps://doi.org/10.1002/net.3230190204openalex-snapshot
On the optimal strongly connected orientations of city street graphs. II: Two east‐west avenues or North—South Streets
inferred← citeshttps://doi.org/10.1002/net.3230190205openalex-snapshot
Connected reorientations of mixed multigraphs
inferred← citeshttps://doi.org/10.1002/net.3230220202openalex-snapshot
On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
inferred← citeshttps://doi.org/10.1002/rsa.3240060409openalex-snapshot
Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
inferred← citeshttps://doi.org/10.1007/3-540-36379-3_19openalex-snapshot
The Complexity of Approximating the Oriented Diameter of Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_25openalex-snapshot
Oriented Diameter of Star Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-50026-9_8openalex-snapshot
An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter
inferred← citeshttps://doi.org/10.1007/978-3-030-94106-2_3openalex-snapshot
Directed and Mixed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-41420-6_66openalex-snapshot
Orientation Number of Two Complete Bipartite Graphs with Linkages
inferred← citeshttps://doi.org/10.1007/978-3-031-82439-5_32openalex-snapshot
An Application of Edge Betweenness Centrality in Bi-objective Optimization of Street Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-00080-0_6openalex-snapshot
Dirhypergraphs: Basic Concepts
inferred← citeshttps://doi.org/10.1007/978-3-319-00080-0_7openalex-snapshot
Applications of Hypergraph Theory: A Brief Overview
inferred← citeshttps://doi.org/10.1007/978-3-319-08001-7_3openalex-snapshot
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_58openalex-snapshot
Graph Orientation and Flows over Time
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_2openalex-snapshot
On the Most Imbalanced Orientation of a Graph
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_7openalex-snapshot
Directing Road Networks by Listing Strong Orientations
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_1openalex-snapshot
Basic Terminology, Notation and Results
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_12openalex-snapshot
Lexicographic Orientation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_66openalex-snapshot
Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_6openalex-snapshot
Edge-Connection of Graphs, Digraphs, and Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-72588-6_58openalex-snapshot
Sharp Bounds for the Oriented Diameters of Interval Graphs and 2-Connected Proper Interval Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_60openalex-snapshot
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-85097-7_18openalex-snapshot
Strong Formulations for 2-Node-Connected Steiner Network Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_42openalex-snapshot
Route-Enabling Graph Orientation Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-11266-9_49openalex-snapshot
Unilateral Orientation of Mixed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-17514-5_7openalex-snapshot
k-cyclic Orientations of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-20036-6_39openalex-snapshot
Optimally Orienting Physical Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-21458-5_35openalex-snapshot
Approximation Algorithms for Orienting Mixed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_53openalex-snapshot
Degree-Constrained Orientations of Embedded Graphs
inferred← citeshttps://doi.org/10.1007/bf01858466openalex-snapshot
The minimum diameter of orientations of complete multipartite graphs
inferred← citeshttps://doi.org/10.1007/bf02085637openalex-snapshot
Simulated annealing and tabu search approaches to unidirectional flowpath design for Automated Guided Vehicle Systems
inferred← citeshttps://doi.org/10.1007/bf02945510openalex-snapshot
Improving the reliability of computer communication networks
inferred← citeshttps://doi.org/10.1007/bf02945511openalex-snapshot
Reconnectable network with limited resources
inferred← citeshttps://doi.org/10.1007/bf02946588openalex-snapshot
Analyzing the reliability of degradable networks
inferred← citeshttps://doi.org/10.1007/bf02986669openalex-snapshot
Minimizing and maximizing the diameter in orientations of graphs
inferred← citeshttps://doi.org/10.1007/bfb0073103openalex-snapshot
On the minimum number of arcs to reverse to make a graph strongly connected
inferred← citeshttps://doi.org/10.1007/s00224-014-9565-5openalex-snapshot
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation
inferred← citeshttps://doi.org/10.1007/s00236-019-00357-3openalex-snapshot
A formal methods approach to predicting new features of the eukaryotic vesicle traffic system
inferred← citeshttps://doi.org/10.1007/s00373-017-1843-yopenalex-snapshot
Coloring Graphs to Produce Properly Colored Walks
inferred← citeshttps://doi.org/10.1007/s00373-020-02152-1openalex-snapshot
Partially Broken Orientations of Eulerian Plane Graphs
inferred← citeshttps://doi.org/10.1007/s00373-020-02220-6openalex-snapshot
Spanning Triangle-Trees and Flows of Graphs
inferred← citeshttps://doi.org/10.1007/s00373-020-02261-xopenalex-snapshot
A Size Condition for Diameter Two Orientable Graphs
inferred← citeshttps://doi.org/10.1007/s00373-021-02333-6openalex-snapshot
Spectral Threshold for Extremal Cyclic Edge-Connectivity
inferred← citeshttps://doi.org/10.1007/s00373-023-02741-wopenalex-snapshot
The Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number
inferred← citeshttps://doi.org/10.1007/s00373-025-02959-wopenalex-snapshot
Diameter Three Orientability of Mixed Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00446-023-00452-2openalex-snapshot
Distributed computations in fully-defective networks
inferred← citeshttps://doi.org/10.1007/s00446-026-00517-yopenalex-snapshot
Non-uniform content-oblivious leader election in 2-edge-connected networks
inferred← citeshttps://doi.org/10.1007/s00453-011-9589-zopenalex-snapshot
Route-Enabling Graph Orientation Problems
inferred← citeshttps://doi.org/10.1007/s00453-017-0399-9openalex-snapshot
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity
inferred← citeshttps://doi.org/10.1007/s00453-019-00580-xopenalex-snapshot
A Tight Lower Bound for Planar Steiner Orientation
inferred← citeshttps://doi.org/10.1007/s00493-015-3173-0openalex-snapshot
Orientations of infinite graphs with prescribed edge-connectivity
inferred← citeshttps://doi.org/10.1007/s00493-025-00159-xopenalex-snapshot
Approximately Packing Dijoins via Nowhere-Zero Flows
inferred← citeshttps://doi.org/10.1007/s10107-010-0375-5openalex-snapshot
Orientation-based models for {0,1,2}-survivable network design: theory and practice
inferred← citeshttps://doi.org/10.1007/s10107-021-01711-5openalex-snapshot
Decreasing minimization on M-convex sets: algorithms and applications
inferred← citeshttps://doi.org/10.1007/s10107-023-01950-8openalex-snapshot
Small separations in pinch-graphic matroids
inferred← citeshttps://doi.org/10.1007/s10287-016-0260-7openalex-snapshot
On the minimum-cost $$\lambda $$ λ -edge-connected k-subgraph problem
inferred← citeshttps://doi.org/10.1007/s10479-019-03248-5openalex-snapshot
Modeling and solving the multi-period disruptions scheduling problem on urban networks
inferred← citeshttps://doi.org/10.1007/s10732-017-9331-3openalex-snapshot
A heuristic approach for dividing graphs into bi-connected components with a size constraint
inferred← citeshttps://doi.org/10.1007/s10878-014-9786-1openalex-snapshot
Degree-constrained orientations of embedded graphs
inferred← citeshttps://doi.org/10.1007/s10878-016-0023-yopenalex-snapshot
Augmenting weighted graphs to establish directed point-to-point connectivity
inferred← citeshttps://doi.org/10.1007/s10878-017-0117-1openalex-snapshot
On the most imbalanced orientation of a graph
inferred← citeshttps://doi.org/10.1007/s10878-018-0329-zopenalex-snapshot
A possible optimal design of one-way Hamming network H(n, 3) based on the minimum transmission latency
inferred← citeshttps://doi.org/10.1007/s10878-021-00789-zopenalex-snapshot
The maximum average connectivity among all orientations of a graph
inferred← citeshttps://doi.org/10.1007/s10878-022-00962-yopenalex-snapshot
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees
inferred← citeshttps://doi.org/10.1007/s13675-015-0035-xopenalex-snapshot
Optimal capacitated ring trees
inferred← citeshttps://doi.org/10.1007/s40314-021-01554-yopenalex-snapshot
Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs
inferred← citeshttps://doi.org/10.1007/s40819-019-0604-4openalex-snapshot
Boundary Vertices of Cartesian Product of Directed Graphs
inferred← citeshttps://doi.org/10.1007/s40840-026-02049-xopenalex-snapshot
On Oriented Diameter of Power Graphs
inferred← citeshttps://doi.org/10.1007/s44425-025-00020-9openalex-snapshot
Diameter Reduction via Arc Reversal
inferred← citeshttps://doi.org/10.1016/0012-365x(76)90080-7openalex-snapshot
Algebraic models for two-edge-connected graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(93)e0168-4openalex-snapshot
Max-balanced flows in oriented matroids
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00315-aopenalex-snapshot
The diameter of an orientation of a complete multipartite graph
inferred← citeshttps://doi.org/10.1016/0024-3795(89)90481-3openalex-snapshot
On orientations and shortest paths
inferred← citeshttps://doi.org/10.1016/0095-8956(78)90078-3openalex-snapshot
Distances in orientations of graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(80)90002-5openalex-snapshot
Digraphs with real and gaussian spectra
inferred← citeshttps://doi.org/10.1016/0166-218x(85)90052-6openalex-snapshot
Orientations with single source and sink
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90217-8openalex-snapshot
On the optimal strongly connected orientations of city street graphs IV: Four east-west avenues or north-south streets
inferred← citeshttps://doi.org/10.1016/0196-6774(88)90038-7openalex-snapshot
Fast parallel strong orientation of mixed graphs and related augmentation problems
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50002-6openalex-snapshot
10.1016/b978-044488002-4/50002-6
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50003-8openalex-snapshot
10.1016/b978-044488002-4/50003-8
inferred← citeshttps://doi.org/10.1016/j.akcej.2019.03.011openalex-snapshot
Strongly connectable digraphs and non-transitive dice
inferred← citeshttps://doi.org/10.1016/j.aml.2010.12.001openalex-snapshot
The optimal strong radius and optimal strong diameter of the Cartesian product graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.05.017openalex-snapshot
On a relation between the domination number and a strongly connected bidirection of an undirected graph
inferred← citeshttps://doi.org/10.1016/j.dam.2014.10.016openalex-snapshot
Path-driven orientation of mixed graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.062openalex-snapshot
The diameter of strong orientations of Cartesian products of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.09.013openalex-snapshot
Metric dimension: From graphs to oriented graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.01.025openalex-snapshot
Oriented diameter of star graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.08.021openalex-snapshot
An improvement to Chvátal and Thomassen’s upper bound for oriented diameter
inferred← citeshttps://doi.org/10.1016/j.dam.2022.04.017openalex-snapshot
On oriented diameter of (n,k) -star graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.06.016openalex-snapshot
Constant delay lattice train schedules
inferred← citeshttps://doi.org/10.1016/j.dam.2025.07.009openalex-snapshot
Obstructions for local tournament orientation completions with cut-vertices
inferred← citeshttps://doi.org/10.1016/j.dam.2026.05.012openalex-snapshot
Oriented diameter of graphs with diameter 4 and given edge girth
inferred← citeshttps://doi.org/10.1016/j.disc.2005.02.010openalex-snapshot
The orientation number of two complete graphs with linkages
inferred← citeshttps://doi.org/10.1016/j.disc.2005.04.012openalex-snapshot
On optimal orientation of cycle vertex multiplications
inferred← citeshttps://doi.org/10.1016/j.disc.2006.01.020openalex-snapshot
Competition-reachability of a graph
inferred← citeshttps://doi.org/10.1016/j.disc.2008.02.039openalex-snapshot
On a conjecture concerning the orientation number of a graph
inferred← citeshttps://doi.org/10.1016/j.disc.2018.12.012openalex-snapshot
A degree condition for diameter two orientability of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113220openalex-snapshot
Obstructions for acyclic local tournament orientation completions
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113287openalex-snapshot
Oriented diameter of graphs with given girth and maximum degree
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113846openalex-snapshot
Large girth and small oriented diameter graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114016openalex-snapshot
Partially broken orientations of Eulerian graphs on closed surfaces
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114406openalex-snapshot
On the oriented diameter of near planar triangulations
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114443openalex-snapshot
The oriented diameter of graphs derived from other graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114509openalex-snapshot
The oriented diameter of a bridgeless graph with the given path P
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114732openalex-snapshot
Diameter two orientability of mixed graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115163openalex-snapshot
The oriented diameter of mixed multigraphs with diameter 2
inferred← citeshttps://doi.org/10.1016/j.disopt.2023.100774openalex-snapshot
The complexity of 2-vertex-connected orientation in mixed graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2016.08.006openalex-snapshot
Improved bound on the oriented diameter of graphs with given minimum degree
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103292openalex-snapshot
Connectivity of orientations of 3-edge-connected graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2017.10.014openalex-snapshot
A column generation approach for the strong network orientation problem
inferred← citeshttps://doi.org/10.1016/j.endm.2018.01.019openalex-snapshot
Methods for solving road network problems with disruptions
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.08.011openalex-snapshot
Metric Dimension: from Graphs to Oriented Graphs
inferred← citeshttps://doi.org/10.1016/j.ifacol.2016.07.812openalex-snapshot
A bi-objective model to address disruptions on unidirectional road networks**This project is funded by the Beijing YuanZhi Tiancheng Technology Co. Ltd, China.
inferred← citeshttps://doi.org/10.1016/j.ins.2005.09.001openalex-snapshot
The edge-orientation problem and some of its variants on weighted graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2023.106434openalex-snapshot
On reversing arcs to improve arc-connectivity
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.01.002openalex-snapshot
Simultaneous well-balanced orientations of graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.02.011openalex-snapshot
The number of nowhere-zero flows on graphs and signed graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2008.01.006openalex-snapshot
Approximate min–max theorems for Steiner rooted-orientations of graphs and hypergraphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2009.08.003openalex-snapshot
Oriented diameter of graphs with diameter 3
inferred← citeshttps://doi.org/10.1016/j.jctb.2014.07.004openalex-snapshot
Strongly 2-connected orientations of graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2016.09.009openalex-snapshot
Extremal H-colorings of trees and 2-connected graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.07.001openalex-snapshot
On Frank's conjecture on k-connected orientations
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.03.003openalex-snapshot
Optimal oriented diameter of graphs with diameter 3
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.09.004openalex-snapshot
Splitting-off in hypergraphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2024.104954openalex-snapshot
Local certification of graph decompositions and applications to minor-free classes
inferred← citeshttps://doi.org/10.1016/j.laa.2016.12.004openalex-snapshot
Imprimitivity index of the adjacency matrix of digraphs
inferred← citeshttps://doi.org/10.1016/j.orl.2013.03.009openalex-snapshot
Tree-compositions and orientations
inferred← citeshttps://doi.org/10.1016/j.sysconle.2023.105524openalex-snapshot
Reaching a consensus with limited information
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.03.044openalex-snapshot
Approximation algorithms for orienting mixed graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.07.019openalex-snapshot
Greedy rectilinear drawings
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.11.019openalex-snapshot
Upper and lower degree-constrained graph orientation with minimum penalty
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114097openalex-snapshot
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114176openalex-snapshot
On orientations maximizing total arc-connectivity
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00233-1openalex-snapshot
On the forced unilateral orientation number of a graph
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00038-7openalex-snapshot
On optimal orientations of cartesian products of graphs (I)
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00051-xopenalex-snapshot
Path-based depth-first search for strong and biconnected components
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00129-4openalex-snapshot
Orienting graphs to optimize reachability
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00462-6openalex-snapshot
On the orientation of graphs and hypergraphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00184-7openalex-snapshot
Cell rotation graphs of strongly connected orientations of plane graphs with an application
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00298-1openalex-snapshot
Algorithms for graphs with small octopus
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00376-7openalex-snapshot
AT-free graphs: linear bounds for the oriented diameter
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00017-6openalex-snapshot
Optimal orientations of products of paths and cycles
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00110-9openalex-snapshot
On optimal orientations of cartesian products with a bipartite graph
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70504-1openalex-snapshot
A Reduction Method for Edge-Connectivity in Graphs
inferred← citeshttps://doi.org/10.1016/s1570-6672(09)60079-9openalex-snapshot
One-Way Traffic Organization Based on Traffic Load and Road Equity
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00216-1openalex-snapshot
Bilateral Orientations and Domination
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80143-xopenalex-snapshot
EDGE-CONNECTIVITIES OF GRAPHS AND DIGRAPHS
inferred← citeshttps://doi.org/10.1017/fmp.2025.4openalex-snapshot
Highly connected orientations from edge-disjoint rigid subgraphs
inferred← citeshttps://doi.org/10.1023/a:1022413100969openalex-snapshot
Strong Connectivity of Polyhedral Complexes
inferred← citeshttps://doi.org/10.1023/a:1022471626622openalex-snapshot
Interpolation theorem for a continuous function on orientations of a simple graph
inferred← citeshttps://doi.org/10.1038/s41598-020-75087-5openalex-snapshot
From bridges to cycles in spectroscopic networks
inferred← citeshttps://doi.org/10.1080/00029890.1980.11995131openalex-snapshot
Robbins's Theorem for Mixed Multigraphs
inferred← citeshttps://doi.org/10.1080/01605682.2019.1639479openalex-snapshot
Bi-objective methods for road network problems with disruptions and connecting requirements
showing the first 200 of 318 · page through all 318
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.