On the public citation graph
Packet routing and job-shop scheduling inO(congestion+dilation) steps
0 signed · 304 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 this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/rsa.3240020402openalex-snapshot
An algorithmic approach to the Lovász local lemma. I
inferredcites →https://doi.org/10.1006/jagm.1994.1030openalex-snapshot
Randomized Routing and Sorting on Fixed-Connection Networks
inferredcites →https://doi.org/10.1109/hicss.1995.375501openalex-snapshot
Fast algorithms for finding O(congestion+dilation) packet routing schedules
inferredcites →https://doi.org/10.1109/sfcs.1988.21942openalex-snapshot
Universal packet routing algorithms
inferredcites →https://doi.org/10.1109/sfcs.1991.185423openalex-snapshot
A parallel algorithmic version of the local lemma
inferredcites →https://doi.org/10.1137/1.9781611970074openalex-snapshot
Ten Lectures on the Probabilistic Method
inferredcites →https://doi.org/10.1145/141914.990672openalex-snapshot
Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992)
inferredcites →https://doi.org/10.1145/256292.256299openalex-snapshot
Work-preserving emulations of fixed-connection networks
inferredcites →https://doi.org/10.1145/73007.73029openalex-snapshot
Work-preserving emulations of fixed-connection networks
inferredcites →https://doi.org/10.21236/ada211915openalex-snapshot
Work-Preserving Emulations of Fixed-Connection Networks
inferredcites →https://doi.org/10.5555/127787.127819openalex-snapshot
Improved approximation algorithms for shop scheduling problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1099-1425(199909/10)2:5<203::aid-jos26>3.0.co;2-5openalex-snapshot
Polynomial time approximation algorithms for machine scheduling: ten open problems
inferred← citeshttps://doi.org/10.1002/1098-2418(200010/12)17:3/4<213::aid-rsa3>3.0.co;2-yopenalex-snapshot
Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma
inferred← citeshttps://doi.org/10.1002/1099-1425(200011/12)3:6<355::aid-jos55>3.0.co;2-vopenalex-snapshot
On-line and off-line preemptive two-machine job shop scheduling
inferred← citeshttps://doi.org/10.1002/jos.96openalex-snapshot
Approximation algorithms for shop scheduling problems with minsum objective
inferred← citeshttps://doi.org/10.1002/net.21474openalex-snapshot
Routing and scheduling for energy and delay minimization in the powerdown model
inferred← citeshttps://doi.org/10.1002/rsa.20016openalex-snapshot
A (1 + ϵ)‐approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma*
inferred← citeshttps://doi.org/10.1006/jagm.1998.0980openalex-snapshot
Shortest-Path Routing in Arbitrary Networks
inferred← citeshttps://doi.org/10.1006/jcss.1999.1681openalex-snapshot
Adaptive Packet Routing for Bursty Adversarial Traffic
inferred← citeshttps://doi.org/10.1006/jcss.2000.1701openalex-snapshot
On the Benefit of Supporting Virtual Channels in Wormhole Routers
inferred← citeshttps://doi.org/10.1006/jpdc.1995.1153openalex-snapshot
Packet Routing in Networks with Long Wires
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1483openalex-snapshot
Packet Routing in Fixed-Connection Networks: A Survey
inferred← citeshttps://doi.org/10.1007/0-306-46964-2_14openalex-snapshot
Sorting and Routing on Hypercubes
inferred← citeshttps://doi.org/10.1007/0-387-27705-6_1openalex-snapshot
Changing Challenges for Collaborative Algorithmics
inferred← citeshttps://doi.org/10.1007/10692760_20openalex-snapshot
Improved Compressions of Cube-Connected Cycles Networks
inferred← citeshttps://doi.org/10.1007/11538462_13openalex-snapshot
Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints
inferred← citeshttps://doi.org/10.1007/11549468_102openalex-snapshot
Efficient Bufferless Routing on Leveled Networks
inferred← citeshttps://doi.org/10.1007/11602569_49openalex-snapshot
Scheduling Multiple Flows on Parallel Disks
inferred← citeshttps://doi.org/10.1007/11671541_11openalex-snapshot
The Lovász-Local-Lemma and Scheduling
inferred← citeshttps://doi.org/10.1007/11775096_9openalex-snapshot
Atomic Routing Games on Maximum Congestion
inferred← citeshttps://doi.org/10.1007/11944874_19openalex-snapshot
Assignment Problems in Rental Markets
inferred← citeshttps://doi.org/10.1007/11944874_30openalex-snapshot
Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic
inferred← citeshttps://doi.org/10.1007/3-540-40064-8_3openalex-snapshot
Approximating Call-Scheduling Makespan in All-Optical Networks
inferred← citeshttps://doi.org/10.1007/3-540-45446-2_6openalex-snapshot
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_2openalex-snapshot
Models and Techniques for Communication in Dynamic Networks
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_15openalex-snapshot
Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_81openalex-snapshot
A packet routing protocol for arbitrary networks
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_154openalex-snapshot
Routing with bounded buffers and hot-potato routing in vertex-symmetric networks
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_62openalex-snapshot
On the drift of short schedules
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_113openalex-snapshot
Direct Routing Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_25openalex-snapshot
A Review of Machine Scheduling: Complexity, Algorithms and Approximability
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_5openalex-snapshot
The Delay Sequence Argument
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_113openalex-snapshot
Direct Routing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-67731-2_3openalex-snapshot
Invited Talk: Resilient Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-67899-9_2openalex-snapshot
Scheduling Trains with Small Stretch on a Unidirectional Line
inferred← citeshttps://doi.org/10.1007/978-3-030-79527-6_4openalex-snapshot
Near-Optimal Scheduling in the Congested Clique
inferred← citeshttps://doi.org/10.1007/978-3-030-92702-8_11openalex-snapshot
FIFO and Randomized Competitive Packet Routing Games
inferred← citeshttps://doi.org/10.1007/978-3-031-49611-0_10openalex-snapshot
Two Exact Algorithms for the Packet Scheduling Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-57942-4_43openalex-snapshot
Hop-Constrained Oblivious Routing Using Prim’s-Sollin’s Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-27866-5_109openalex-snapshot
Near-Optimal Hot-Potato Routing on Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-31833-0_20openalex-snapshot
Universal Bufferless Routing
inferred← citeshttps://doi.org/10.1007/978-3-642-02250-0_10openalex-snapshot
Permutation Routing and (ℓ, k)-Routing on Plane Grids
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_56openalex-snapshot
Improved Bounds for Flow Shop Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_37openalex-snapshot
Improved Algorithms for Latency Minimization in Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_17openalex-snapshot
Real-Time Message Routing and Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_12openalex-snapshot
Packet Routing on the Grid
inferred← citeshttps://doi.org/10.1007/978-3-642-12450-1_20openalex-snapshot
Packet Routing: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-14849-1_13openalex-snapshot
Oblivious Routing for Sensor Network Topologies
inferred← citeshttps://doi.org/10.1007/978-3-642-15763-9_16openalex-snapshot
Distributed Contention Resolution in Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-15763-9_7openalex-snapshot
Window-Based Greedy Contention Management for Transactional Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-16170-4_20openalex-snapshot
Bottleneck Congestion Games with Logarithmic Price of Anarchy
inferred← citeshttps://doi.org/10.1007/978-3-642-17514-5_23openalex-snapshot
Policies for Periodic Packet Routing
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_29openalex-snapshot
Universal Packet Routing with Arbitrary Bandwidths and Transit Times
inferred← citeshttps://doi.org/10.1007/978-3-642-29222-4_30openalex-snapshot
Optimal Oblivious Routing in Hole-Free Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-29667-3_11openalex-snapshot
Scheduling of Vehicles in Transportation Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-30373-9_21openalex-snapshot
Bottleneck Routing Games on Grids
inferred← citeshttps://doi.org/10.1007/978-3-642-30373-9_22openalex-snapshot
Optimal Price of Anarchy of Polynomial and Super-Polynomial Bottleneck Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-642-31869-6_10openalex-snapshot
Lower Bounds on Data Collection Time in Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_50openalex-snapshot
Stretch in Bottleneck Games
inferred← citeshttps://doi.org/10.1007/978-3-642-36694-9_29openalex-snapshot
A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet Routing
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_53openalex-snapshot
Packet Forwarding Algorithms in a Line Network
inferred← citeshttps://doi.org/10.1007/978-3-642-61012-7_10openalex-snapshot
Kommunikation in parallelen Rechnernetzen
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_33openalex-snapshot
Scheduling Bidirectional Traffic on a Path
inferred← citeshttps://doi.org/10.1007/978-981-16-5987-4_19openalex-snapshot
Optimal Packet Routing with Multiple Demands and Link Lines
inferred← citeshttps://doi.org/10.1007/bf01585870openalex-snapshot
Approximability of flow shop scheduling
inferred← citeshttps://doi.org/10.1007/s00224-004-1136-8openalex-snapshot
Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks
inferred← citeshttps://doi.org/10.1007/s00224-006-1349-0openalex-snapshot
The Effect of Faults on Network Expansion
inferred← citeshttps://doi.org/10.1007/s00224-010-9250-2openalex-snapshot
Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
inferred← citeshttps://doi.org/10.1007/s00446-020-00383-2openalex-snapshot
Low-Congestion shortcuts without embedding
inferred← citeshttps://doi.org/10.1007/s00446-022-00431-zopenalex-snapshot
Linear-Size hopsets with small hopbound, and constant-hopbound hopsets in RNC
inferred← citeshttps://doi.org/10.1007/s00446-023-00455-zopenalex-snapshot
Near-optimal distributed computation of small vertex cuts
inferred← citeshttps://doi.org/10.1007/s00453-001-0090-yopenalex-snapshot
Distributed and On-Line Routing on Tori
inferred← citeshttps://doi.org/10.1007/s00453-004-1086-1openalex-snapshot
Simple On-Line Algorithms for the Maximum Disjoint Paths Problem
inferred← citeshttps://doi.org/10.1007/s00453-005-1189-3openalex-snapshot
Direct routing: Algorithms and complexity
inferred← citeshttps://doi.org/10.1007/s00453-007-9004-yopenalex-snapshot
Scheduling on Unrelated Machines under Tree-Like Precedence Constraints
inferred← citeshttps://doi.org/10.1007/s00453-016-0177-0openalex-snapshot
Online Packet-Routing in Grids with Bounded Buffers
inferred← citeshttps://doi.org/10.1007/s00493-023-00033-8openalex-snapshot
Routing Permutations on Spectral Expanders via Matchings
inferred← citeshttps://doi.org/10.1007/s004930170007openalex-snapshot
Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols
inferred← citeshttps://doi.org/10.1007/s004930200018openalex-snapshot
Improved Bounds for Acyclic Job Shop Scheduling
inferred← citeshttps://doi.org/10.1007/s006070170017openalex-snapshot
Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines
inferred← citeshttps://doi.org/10.1007/s10479-012-1290-3openalex-snapshot
On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion
inferred← citeshttps://doi.org/10.1007/s10951-008-0069-5openalex-snapshot
The impact of local policies on the quality of packet routing in paths, trees, and rings
inferred← citeshttps://doi.org/10.1007/s10951-018-0591-zopenalex-snapshot
Scheduling problems over a network of machines
inferred← citeshttps://doi.org/10.1007/s10951-024-00823-yopenalex-snapshot
Network routing on regular digraphs and their line graphs
inferred← citeshttps://doi.org/10.1007/s11227-014-1376-6openalex-snapshot
Efficient task scheduling algorithms for heterogeneous multi-cloud environment
inferred← citeshttps://doi.org/10.1007/s11276-014-0878-8openalex-snapshot
Routing algorithm of minimizing maximum link congestion on grid networks
inferred← citeshttps://doi.org/10.1007/s11432-020-2931-xopenalex-snapshot
A nearly optimal distributed algorithm for computing the weighted girth
inferred← citeshttps://doi.org/10.1007/s11432-020-2996-2openalex-snapshot
Efficient distributed algorithms for holistic aggregation functions on random regular graphs
inferred← citeshttps://doi.org/10.1007/s11590-013-0613-xopenalex-snapshot
Scheduling problems in transportation networks of line topology
inferred← citeshttps://doi.org/10.1016/j.cor.2012.02.024openalex-snapshot
Solving the job-shop scheduling problem optimally by dynamic programming
inferred← citeshttps://doi.org/10.1016/j.cor.2012.12.004openalex-snapshot
An optimal method for the preemptive job shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.03.004openalex-snapshot
Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule
inferred← citeshttps://doi.org/10.1016/j.jda.2004.04.008openalex-snapshot
Approximating call-scheduling makespan in all-optical networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.01.004openalex-snapshot
The fat-stack and universal routing in interconnection networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.02.003openalex-snapshot
Provable algorithms for parallel generalized sweep scheduling
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.06.005openalex-snapshot
Efficient bufferless packet switching on trees and leveled networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.04.015openalex-snapshot
Atomic routing games on maximum congestion
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.004openalex-snapshot
Improved algorithms for latency minimization in wireless networks
inferred← citeshttps://doi.org/10.1016/s0167-8191(96)00064-6openalex-snapshot
Parallel matrix product algorithm in the de Bruijn network using emulation of meshes of trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00255-9openalex-snapshot
Approximation algorithms for routing and call scheduling in all-optical chains and rings
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00326-7openalex-snapshot
On the drift of short schedules
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00198-9openalex-snapshot
Efficient delay routing
inferred← citeshttps://doi.org/10.1016/s0925-5273(02)00370-5openalex-snapshot
Cyclic deadlock prediction and avoidance for zone-controlled AGV system
inferred← citeshttps://doi.org/10.1017/apr.2021.27openalex-snapshot
A stochastic process on a network with connections to Laplacian systems of equations
inferred← citeshttps://doi.org/10.1038/nature03459openalex-snapshot
The origin of bursts and heavy tails in human dynamics
inferred← citeshttps://doi.org/10.1051/ita:2008024openalex-snapshot
On the power of randomization for job shop scheduling withk-units length tasks
inferred← citeshttps://doi.org/10.1051/ro/2014051openalex-snapshot
O(log m)-approximation for the routing open shop problem
inferred← citeshttps://doi.org/10.1109/12.338095openalex-snapshot
The fat-pyramid and universal parallel computation independent of wire delay
inferred← citeshttps://doi.org/10.1109/71.706051openalex-snapshot
Improved compressions of cube-connected cycles networks
inferred← citeshttps://doi.org/10.1109/71.888647openalex-snapshot
Complexity of minimum length scheduling for precedence constrained messages in distributed systems
inferred← citeshttps://doi.org/10.1109/71.926169openalex-snapshot
Wait-free deflection routing of long messages
inferred← citeshttps://doi.org/10.1109/90.491013openalex-snapshot
On the hardness of approximating optimum schedule problems in store and forward networks
inferred← citeshttps://doi.org/10.1109/90.720877openalex-snapshot
A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks
inferred← citeshttps://doi.org/10.1109/ciss.2006.286378openalex-snapshot
A Survey of Congestion+Dilation Results for Packet Scheduling
inferred← citeshttps://doi.org/10.1109/focs.2008.36openalex-snapshot
(Acyclic) Job Shops are Hard to Approximate
inferred← citeshttps://doi.org/10.1109/focs.2010.45openalex-snapshot
New Constructive Aspects of the Lovasz Local Lemma
inferred← citeshttps://doi.org/10.1109/focs.2013.57openalex-snapshot
The Moser--Tardos Framework with Partial Resampling
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00053openalex-snapshot
Network Coding Gaps for Completion Times of Multiple Unicasts
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00087openalex-snapshot
Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00016openalex-snapshot
Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00144openalex-snapshot
Secure Computation Meets Distributed Universal Optimality
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00102openalex-snapshot
New Structures and Algorithms for Length-Constrained Expander Decompositions
inferred← citeshttps://doi.org/10.1109/glocom.2002.1188031openalex-snapshot
Scheduling algorithms for wireless ad-hoc sensor networks
inferred← citeshttps://doi.org/10.1109/hicss.1995.375501openalex-snapshot
Fast algorithms for finding O(congestion+dilation) packet routing schedules
inferred← citeshttps://doi.org/10.1109/hicss.2004.1265481openalex-snapshot
Distributed path selection (DPS) a traffic engineering protocol for IP-networks
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2019.00057openalex-snapshot
C-MAP: Improving the Effectiveness of Mapping Method for CGRA by Reducing NoC Congestion
inferred← citeshttps://doi.org/10.1109/icastech.2013.6707514openalex-snapshot
The design and implementation of a network simulation platform
inferred← citeshttps://doi.org/10.1109/icc.1999.765509openalex-snapshot
A note on deterministic end-to-end delay analysis in connection oriented networks
inferred← citeshttps://doi.org/10.1109/icdcs.2006.82openalex-snapshot
The Confluent Capacity of the Internet: Congestion vs. Dilation
inferred← citeshttps://doi.org/10.1109/icpads.2005.288openalex-snapshot
Universal Routing in Distributed Networks
inferred← citeshttps://doi.org/10.1109/icpp.2007.12openalex-snapshot
Adaptive Scheduling of Parallel Jobs on Functionally Heterogeneous Resources
inferred← citeshttps://doi.org/10.1109/igcc.2016.7892589openalex-snapshot
COMRANCE: A rapid method for Network-on-Chip design space exploration
inferred← citeshttps://doi.org/10.1109/infcom.1999.749305openalex-snapshot
Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule
inferred← citeshttps://doi.org/10.1109/infcom.2003.1208943openalex-snapshot
Packets distribution algorithms for sensor networks
inferred← citeshttps://doi.org/10.1109/infcom.2010.5462279openalex-snapshot
Routing and Scheduling for Energy and Delay Minimization in the Powerdown Model
inferred← citeshttps://doi.org/10.1109/infocom.2008.32openalex-snapshot
Satisfying Arbitrary Delay Requirements in Multihop Networks
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213148openalex-snapshot
Routing on meshes in optimum time and with really small queues
inferred← citeshttps://doi.org/10.1109/ipdps.2005.311openalex-snapshot
Optimal Oblivious Path Selection on the Mesh
inferred← citeshttps://doi.org/10.1109/ipdps.2005.366openalex-snapshot
Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes
inferred← citeshttps://doi.org/10.1109/ipps.1998.669937openalex-snapshot
Emulating direct products by index-shuffle graphs
inferred← citeshttps://doi.org/10.1109/ispan.1996.508953openalex-snapshot
A critical look at three of parallel computing's maxims
inferred← citeshttps://doi.org/10.1109/issa.2013.6641048openalex-snapshot
A kernel-driven framework for high performance internet routing simulation
inferred← citeshttps://doi.org/10.1109/iwqos.2008.13openalex-snapshot
Obtaining High Throughput in Networks with Tiny Buffers
inferred← citeshttps://doi.org/10.1109/jsac.2004.830927openalex-snapshot
Lower Bounds on Data Collection Time in Sensory Networks
inferred← citeshttps://doi.org/10.1109/jsyst.2017.2760886openalex-snapshot
Formation of Bidding Zones Based on Linear Bottleneck Games
inferred← citeshttps://doi.org/10.1109/nca.2013.20openalex-snapshot
A Universally Stable and Energy-Efficient Scheduling Protocol for Packet Switching Network
inferred← citeshttps://doi.org/10.1109/pimrc69400.2026.11711805openalex-snapshot
Power-Aware Multi-Send in Wireless Networks
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492465openalex-snapshot
Approximability of flow shop scheduling
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548496openalex-snapshot
Deterministic routing with bounded buffers: turning offline into online protocols
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548497openalex-snapshot
Universal stability results for greedy contention-resolution protocols
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646118openalex-snapshot
General dynamic routing with per-packet delay guarantees of O(distance+1/session rate)
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959891openalex-snapshot
Source routing and scheduling in packet networks
inferred← citeshttps://doi.org/10.1109/tase.2013.2247757openalex-snapshot
Parallel Machine Selection and Job Scheduling to Minimize Sum of Machine Holding Cost, Total Machine Time Costs, and Total Tardiness Costs
inferred← citeshttps://doi.org/10.1109/tc.2008.23openalex-snapshot
Optimal Oblivious Path Selection on the Mesh
inferred← citeshttps://doi.org/10.1109/tc.2011.145openalex-snapshot
Approximating Congestion + Dilation in Networks via "Quality of Routing” Games
inferred← citeshttps://doi.org/10.1109/tit.2009.2012999openalex-snapshot
Random Sensory Networks: A Delay Analysis
inferred← citeshttps://doi.org/10.1109/tpds.2008.75openalex-snapshot
Trade-Offs between Stretch Factor and Load-Balancing Ratio in Routing on Growth-Restricted Graphs
inferred← citeshttps://doi.org/10.1137/050642095openalex-snapshot
Universal Bufferless Packet Switching
inferred← citeshttps://doi.org/10.1137/1.9781611973082.120openalex-snapshot
A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch18openalex-snapshot
The Adversarial Noise Threshold for Distributed Protocols
inferred← citeshttps://doi.org/10.1137/1.9781611975482.101openalex-snapshot
Low Congestion Cycle Covers and Their Applications
inferred← citeshttps://doi.org/10.1137/1.9781611975482.102openalex-snapshot
Distributed Algorithms Made Secure: A Graph Theoretic Approach
inferred← citeshttps://doi.org/10.1137/1.9781611977073.15openalex-snapshot
On the Hardness of Scheduling With Non-Uniform Communication Delays
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch93openalex-snapshot
Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models
inferred← citeshttps://doi.org/10.1137/100799642openalex-snapshot
Deterministic Algorithms for the Lovász Local Lemma
inferred← citeshttps://doi.org/10.1137/s0097539793255011openalex-snapshot
Reconfiguring Arrays with Faults Part I: Worst-Case Faults
inferred← citeshttps://doi.org/10.1137/s0097539793255163openalex-snapshot
On the Fault Tolerance of Some Popular Bounded-Degree Networks
inferred← citeshttps://doi.org/10.1137/s0097539794270364openalex-snapshot
Efficient Self-Embedding of Butterfly Networks with Random Faults
inferred← citeshttps://doi.org/10.1137/s0097539798335596openalex-snapshot
A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria
inferred← citeshttps://doi.org/10.1137/s009753979935061xopenalex-snapshot
General Dynamic Routing with Per-Packet Delay Guarantees of O (Distance + 1/Session Rate)
inferred← citeshttps://doi.org/10.1137/s0097539799353431openalex-snapshot
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
inferred← citeshttps://doi.org/10.1137/s0895480102419743openalex-snapshot
Algorithms for Fault‐Tolerant Routing in Circuit‐Switched Networks
inferred← citeshttps://doi.org/10.1137/s0895480199326104openalex-snapshot
Better Approximation Guarantees for Job-Shop Scheduling
inferred← citeshttps://doi.org/10.1137/s0895480199363908openalex-snapshot
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
inferred← citeshttps://doi.org/10.1142/s0219265904001258openalex-snapshot
APPROXIMATING HYPERCUBES BY INDEX-SHUFFLE GRAPHS VIA DIRECT-PRODUCT EMULATIONS
inferred← citeshttps://doi.org/10.1142/s0219265907001886openalex-snapshot
UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS
inferred← citeshttps://doi.org/10.1142/s0219265909002431openalex-snapshot
(ℓ, k)-ROUTING ON PLANE GRIDS
inferred← citeshttps://doi.org/10.1145/1007912.1007929openalex-snapshot
Lower bounds for graph embeddings and combinatorial preconditioners
inferred← citeshttps://doi.org/10.1145/1007912.1007960openalex-snapshot
The effect of faults on network expansion
inferred← citeshttps://doi.org/10.1145/1011767.1011795openalex-snapshot
Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs
inferred← citeshttps://doi.org/10.1145/1073970.1074000openalex-snapshot
Selfish routing with incomplete information
inferred← citeshttps://doi.org/10.1145/1073970.1074022openalex-snapshot
Oblivious routing on geometric networks
inferred← citeshttps://doi.org/10.1145/1082036.1082040openalex-snapshot
Source routing and scheduling in packet networks
inferred← citeshttps://doi.org/10.1145/1248377.1248383openalex-snapshot
Approximation algorithms for multiprocessor scheduling under uncertainty
inferred← citeshttps://doi.org/10.1145/1288107.1288123openalex-snapshot
Cross-layer latency minimization in wireless networks with SINR constraints
inferred← citeshttps://doi.org/10.1145/1375457.1375502openalex-snapshot
Optimal delay scheduling in networks with arbitrary constraints
inferred← citeshttps://doi.org/10.1145/1378533.1378579openalex-snapshot
Improved approximations for multiprocessor scheduling under uncertainty
inferred← citeshttps://doi.org/10.1145/1384529.1375502openalex-snapshot
Optimal delay scheduling in networks with arbitrary constraints
inferred← citeshttps://doi.org/10.1145/195058.195117openalex-snapshot
On the fault tolerance of the butterfly
inferred← citeshttps://doi.org/10.1145/1989493.1989525openalex-snapshot
Online packet-routing in grids with bounded buffers
showing the first 200 of 292 · page through all 292
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.