On the public citation graph

Data transfers in networks

0 signed · 49 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jgt.3190100202openalex-snapshot

A generalization of edge‐coloring in graphs

inferredcites →https://doi.org/10.1002/net.3230170404openalex-snapshot

Data transfers in networks with transceivers

inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot

Graph Theory with Applications

inferredcites →https://doi.org/10.1007/978-94-011-7557-9_18openalex-snapshot

A Few Remarks on Chromatic Scheduling

inferredcites →https://doi.org/10.1007/bf01456961openalex-snapshot

Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre

inferredcites →https://doi.org/10.1016/0196-6774(86)90024-6openalex-snapshot

An algorithmic proof of a generalization of the birkhoff-von neumann theorem

inferredcites →https://doi.org/10.1109/proc.1977.10493openalex-snapshot

Analysis of a switch matrix for an SS/TDMA system

inferredcites →https://doi.org/10.1109/tcom.1981.1095028openalex-snapshot

An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders

inferredcites →https://doi.org/10.1109/tcom.1981.1095097openalex-snapshot

A General Multibeam Satellite Switching Algorithm

inferredcites →https://doi.org/10.1109/tcom.1982.1095433openalex-snapshot

An Optimal Switching Algorithm for Multibeam Satellite Systems with Variable Bandwidth Beams

inferredcites →https://doi.org/10.1109/tcom.1985.1096336openalex-snapshot

Minimizing the Number of Switchings in an SS/TDMA System

inferredcites →https://doi.org/10.1137/0211043openalex-snapshot

On Edge Coloring Bipartite Graphs

inferredcites →https://doi.org/10.1137/0214054openalex-snapshot

Scheduling File Transfers

inferredcites →https://doi.org/10.1137/0216013openalex-snapshot

Scheduling File Transfers for Trees and Odd Cycles

inferredcites →https://doi.org/10.1137/0608043openalex-snapshot

SS/TDMA Satellite Communications with k -Permutation Switching Modes

inferredcites →https://doi.org/10.1145/322092.322101openalex-snapshot

On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

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)1097-0118(199912)32:4<311::aid-jgt1>3.0.co;2-xopenalex-snapshot

Improved bounds for the chromatic index of graphs and multigraphs

inferred← citeshttps://doi.org/10.1002/net.3230170404openalex-snapshot

Data transfers in networks with transceivers

inferred← citeshttps://doi.org/10.1002/net.3230220606openalex-snapshot

Scheduling file transfers in fully connected networks

inferred← citeshttps://doi.org/10.1006/jpdc.1996.0057openalex-snapshot

On-Line Routing of Real-Time Messages

inferred← citeshttps://doi.org/10.1006/jpdc.1998.1500openalex-snapshot

Complexity and Approximations for Multimessage Multicasting

inferred← citeshttps://doi.org/10.1006/jpdc.1998.1506openalex-snapshot

Routing and Scheduling I/O Transfers on Wormhole-Routed Mesh Networks

inferred← citeshttps://doi.org/10.1007/3-540-36136-7_39openalex-snapshot

File Transfer Tree Problems

inferred← citeshttps://doi.org/10.1007/978-1-4757-3145-3_11openalex-snapshot

On Approximating a Scheduling Problem

inferred← citeshttps://doi.org/10.1007/bfb0018539openalex-snapshot

Exchange of messages of different sizes

inferred← citeshttps://doi.org/10.1007/bfb0030112openalex-snapshot

Multi-Message Multicasting

inferred← citeshttps://doi.org/10.1007/s004530010072openalex-snapshot

Simple Algorithms for Multimessage Multicasting with Forwarding

inferred← citeshttps://doi.org/10.1016/b978-0-08-040806-4.50027-7openalex-snapshot

A GRAPH-THEORETIC MODEL FOR THE SCHEDULING PROBLEM AND ITS APPLICATION TO SIMULTANEOUS RESOURCE SCHEDULING

inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.06.003openalex-snapshot

Exchanging messages of different sizes

inferred← citeshttps://doi.org/10.1023/a:1011441109660openalex-snapshot

On Approximating a Scheduling Problem

inferred← citeshttps://doi.org/10.1023/a:1019113521414openalex-snapshot

On scheduling variable length broadcasts in wireless networks

inferred← citeshttps://doi.org/10.1109/12.256452openalex-snapshot

Data transfers in broadcast networks

inferred← citeshttps://doi.org/10.1109/49.510917openalex-snapshot

Impact of tuning delay on the performance of bandwidth-limited optical broadcast networks with uniform traffic

inferred← citeshttps://doi.org/10.1109/90.556359openalex-snapshot

Efficient scheduling of transmissions in optical broadcast networks

inferred← citeshttps://doi.org/10.1109/ccgrid.2002.1017146openalex-snapshot

Scalable Algorithms for Complete Exchange on Multi-Cluster Networks

inferred← citeshttps://doi.org/10.1109/emwrt.1989.43456openalex-snapshot

Routing messages with release time and deadline constraints

inferred← citeshttps://doi.org/10.1109/hicss.1997.667217openalex-snapshot

Multimessage multicasting: complexity and approximations

inferred← citeshttps://doi.org/10.1109/icc.1991.162262openalex-snapshot

Scheduling packet transfers in a class of TDM hierarchical switching systems

inferred← citeshttps://doi.org/10.1109/icc.1995.525176openalex-snapshot

Optimum transmission scheduling in optical broadcast networks

inferred← citeshttps://doi.org/10.1109/infcom.1992.263489openalex-snapshot

Scheduling data transfers in preemptive hierarchical switching systems with applications to packet radio networks

inferred← citeshttps://doi.org/10.1109/infcom.1995.515870openalex-snapshot

The effects of tuning time in bandwidth-limited optical broadcast networks

inferred← citeshttps://doi.org/10.1109/real.1990.128738openalex-snapshot

On-line routing of real-time messages

inferred← citeshttps://doi.org/10.1109/tpds.2007.70801openalex-snapshot

Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode

inferred← citeshttps://doi.org/10.1137/0216013openalex-snapshot

Scheduling File Transfers for Trees and Odd Cycles

inferred← citeshttps://doi.org/10.1137/0219015openalex-snapshot

The Complexity of File Transfer Scheduling with Forwarding

inferred← citeshttps://doi.org/10.1142/s0129054101000874openalex-snapshot

ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS

inferred← citeshttps://doi.org/10.1142/s0129626409000110openalex-snapshot

Improved Communication Schedules with Buffers

inferred← citeshttps://doi.org/10.1142/s0219265900000184openalex-snapshot

DISTRIBUTED ALGORITHM FOR MULTIMESSAGE MULTICASTING

inferred← citeshttps://doi.org/10.11606/d.45.2006.tde-01082007-002437openalex-snapshot

O problema da troca de mensagens de diferentes tamanhos em redes multi-aglomerados

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.