On the public citation graph
Orthogonal representations over finite fields and the chromatic number of graphs
0 signed · 139 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.1007/bf02122698openalex-snapshot
Applications of matrix methods to the theory of lower bounds in computational complexity
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1016/0024-3795(89)90475-8openalex-snapshot
Orthogonal representations and connectivity of graphs
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1017/s030500410002168xopenalex-snapshot
On colouring the nodes of a network
inferredcites →https://doi.org/10.1109/tit.1956.1056798openalex-snapshot
The zero error capacity of a noisy channel
inferredcites →https://doi.org/10.1109/tit.1979.1055985openalex-snapshot
On the Shannon capacity of a graph
inferredcites →https://doi.org/10.1109/tit.1979.1056027openalex-snapshot
On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
inferredcites →https://doi.org/10.1109/tit.1979.1056072openalex-snapshot
A comparison of the Delsarte and Lovász bounds
inferredcites →https://doi.org/10.1111/j.1749-6632.1970.tb45136.xopenalex-snapshot
ON EIGENVALUES AND COLORINGS OF GRAPHS, II
inferredcites →https://doi.org/10.1145/321921.321926openalex-snapshot
The Complexity of Near-Optimal Graph Coloring
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ett.2789openalex-snapshot
Survey on cooperative strategies for wireless relay channels
inferred← citeshttps://doi.org/10.1006/jctb.2000.2003openalex-snapshot
Chromatic Number and the 2-Rank of a Graph
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_63openalex-snapshot
Vector Choosability in Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-00200-2_7openalex-snapshot
Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint
inferred← citeshttps://doi.org/10.1007/978-3-319-27568-0_18openalex-snapshot
Index Coding: A Greener Door for Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-70293-3_10openalex-snapshot
Index Coding, Network Coding and Broadcast with Side-Information
inferred← citeshttps://doi.org/10.1007/978-3-642-32147-4_32openalex-snapshot
The Gram Dimension of a Graph
inferred← citeshttps://doi.org/10.1007/s00220-012-1451-xopenalex-snapshot
Entanglement can Increase Asymptotic Rates of Zero-Error Classical Communication over Classical Channels
inferred← citeshttps://doi.org/10.1007/s00453-013-9789-9openalex-snapshot
Polynomial Time Algorithm for Min-Ranks of Graphs with Simple Tree Structures
inferred← citeshttps://doi.org/10.1007/s00493-025-00136-4openalex-snapshot
L-Systems and the Lovász Number
inferred← citeshttps://doi.org/10.1007/s10208-023-09637-4openalex-snapshot
Computational Complexity of Decomposing a Symmetric Matrix as a Sum of Positive Semidefinite and Diagonal Matrices
inferred← citeshttps://doi.org/10.1007/s10801-020-00983-yopenalex-snapshot
A unified construction of semiring-homomorphic graph invariants
inferred← citeshttps://doi.org/10.1007/s41468-024-00169-6openalex-snapshot
The shift-dimension of multipersistence modules
inferred← citeshttps://doi.org/10.1016/j.dam.2016.04.028openalex-snapshot
A new property of the Lovász number and duality relations between graph parameters
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112785openalex-snapshot
On the hat guessing number of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.04.006openalex-snapshot
Topological bounds on the dimension of orthogonal representations of graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103757openalex-snapshot
Kernelization for orthogonality dimension
inferred← citeshttps://doi.org/10.1016/j.jcta.2025.106059openalex-snapshot
Kernels for storage capacity and dual index coding
inferred← citeshttps://doi.org/10.1016/j.laa.2020.09.017openalex-snapshot
Interval matrices: Realization of ranks by rational matrices
inferred← citeshttps://doi.org/10.1017/s0963548312000296openalex-snapshot
A Graph Polynomial for Independent Sets of Bipartite Graphs
inferred← citeshttps://doi.org/10.1017/s0963548313000564openalex-snapshot
Linear Index Coding via Semidefinite Programming
inferred← citeshttps://doi.org/10.1080/03081087.2015.1083565openalex-snapshot
Matrix completion and tensor rank
inferred← citeshttps://doi.org/10.1080/03081087.2017.1315044openalex-snapshot
On the equivalence between low-rank matrix completion and tensor rank
inferred← citeshttps://doi.org/10.1088/1367-2630/ac3a84openalex-snapshot
Large violations in Kochen Specker contextuality and their applications
inferred← citeshttps://doi.org/10.1103/physreva.97.020103openalex-snapshot
Learning optimal quantum models is NP-hard
inferred← citeshttps://doi.org/10.1103/physrevlett.112.040401openalex-snapshot
Graph-Theoretic Approach to Quantum Correlations
inferred← citeshttps://doi.org/10.1103/physrevresearch.7.023104openalex-snapshot
Unbounded quantum advantage in communication with minimal input scaling
inferred← citeshttps://doi.org/10.1109/access.2024.3368632openalex-snapshot
Extreme Rate Optimal Index Code
inferred← citeshttps://doi.org/10.1109/access.2025.3529186openalex-snapshot
Optimal Index Code With Rate 4 Over F₂
inferred← citeshttps://doi.org/10.1109/allerton.2013.6736712openalex-snapshot
Duality codes and the integrality gap bound for index coding
inferred← citeshttps://doi.org/10.1109/allerton49937.2022.9929398openalex-snapshot
Hardness of Linear Index Coding on Perturbed Instances
inferred← citeshttps://doi.org/10.1109/ciss.2018.8362252openalex-snapshot
Optimal error correcting index codes for two classes of index coding problems
inferred← citeshttps://doi.org/10.1109/codit.2014.6996886openalex-snapshot
Linear index coding via graph homomorphism
inferred← citeshttps://doi.org/10.1109/conecct68978.2026.11700641openalex-snapshot
A Machine Learning Approach to Predict Structural Properties in Single Unicast Index Coding Problems
inferred← citeshttps://doi.org/10.1109/focs.2006.42openalex-snapshot
Index Coding with Side Information
inferred← citeshttps://doi.org/10.1109/glocom.2012.6503457openalex-snapshot
Finding three transmissions is hard
inferred← citeshttps://doi.org/10.1109/glocom.2017.8254152openalex-snapshot
Index Coding with Restricted Information (ICRI) and Interference Alignment
inferred← citeshttps://doi.org/10.1109/glocomw.2016.7848993openalex-snapshot
Optimal Scalar Linear Index Codes for One-Sided Neighboring Side-Information Problems
inferred← citeshttps://doi.org/10.1109/icc.2017.7997268openalex-snapshot
Binary index codes using l-th NMDS codes
inferred← citeshttps://doi.org/10.1109/isit.2008.4594999openalex-snapshot
On the hardness of approximating the network coding capacity
inferred← citeshttps://doi.org/10.1109/isit.2011.6034211openalex-snapshot
Zero-error communication via quantum channels and a quantum Lovász θ-function
inferred← citeshttps://doi.org/10.1109/isit.2011.6034247openalex-snapshot
Index coding with outerplanar side information
inferred← citeshttps://doi.org/10.1109/isit.2011.6034286openalex-snapshot
On secure Index Coding with Side Information
inferred← citeshttps://doi.org/10.1109/isit.2012.6283850openalex-snapshot
On linear index coding for random graphs
inferred← citeshttps://doi.org/10.1109/isit.2012.6283852openalex-snapshot
Optimal index codes with near-extreme rates
inferred← citeshttps://doi.org/10.1109/isit.2014.6874842openalex-snapshot
Bounding multiple unicasts through index coding and Locally Repairable Codes
inferred← citeshttps://doi.org/10.1109/isit.2014.6874881openalex-snapshot
Linear Codes are Optimal for Index-Coding Instances with Five or Fewer Receivers
inferred← citeshttps://doi.org/10.1109/isit.2015.7282481openalex-snapshot
On approximating the sum-rate for multiple-unicasts
inferred← citeshttps://doi.org/10.1109/isit.2015.7282610openalex-snapshot
A new index coding scheme exploiting interlinked cycles
inferred← citeshttps://doi.org/10.1109/isit.2017.8006990openalex-snapshot
Generalized Index Coding Problem and Discrete Polymatroids
inferred← citeshttps://doi.org/10.1109/isit.2017.8007094openalex-snapshot
Rate 1/3 index coding: Forbidden and feasible configurations
inferred← citeshttps://doi.org/10.1109/isit.2018.8437469openalex-snapshot
Optimal Error Correcting Delivery Scheme for Coded Caching with Symmetric Batch Prefetching
inferred← citeshttps://doi.org/10.1109/isit.2019.8849406openalex-snapshot
An Optimal Linear Error Correcting Delivery Scheme for Coded Caching with Shared Caches
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206551openalex-snapshot
Matrix Completion over Finite Fields: Bounds and Belief Propagation Algorithms
inferred← citeshttps://doi.org/10.1109/istc.2018.8625330openalex-snapshot
A Binary Randomized Coding Scheme for Pliable Index Coding with Multiple Requests
inferred← citeshttps://doi.org/10.1109/ita.2015.7308992openalex-snapshot
On linear index coding from graph homomorphism perspective
inferred← citeshttps://doi.org/10.1109/itw.2014.6970888openalex-snapshot
A matrix completion approach to linear index coding problem
inferred← citeshttps://doi.org/10.1109/itw.2018.8613453openalex-snapshot
On the Broadcast Rate and Fractional Clique Cover of Single Unicast Index Coding Problems
inferred← citeshttps://doi.org/10.1109/itwf.2015.7360723openalex-snapshot
Generalized interlinked cycle cover for index coding
inferred← citeshttps://doi.org/10.1109/itwf.2015.7360725openalex-snapshot
Index coding and network coding via rank minimization
inferred← citeshttps://doi.org/10.1109/iwcit.2016.7491621openalex-snapshot
Dynamic index coding gain over a complete bi-directional side information graph
inferred← citeshttps://doi.org/10.1109/jsait.2020.3012708openalex-snapshot
The Haemers Bound of Noncommutative Graphs
inferred← citeshttps://doi.org/10.1109/ncc.2018.8599997openalex-snapshot
Optimal Index Codes via a Duality between Index Coding and Network Coding
inferred← citeshttps://doi.org/10.1109/ncc.2018.8600160openalex-snapshot
Linear Codes for Broadcasting With Noisy Side Information
inferred← citeshttps://doi.org/10.1109/netcod.2014.6892122openalex-snapshot
A new class of index coding instances where linear coding is optimal
inferred← citeshttps://doi.org/10.1109/pimrc.2012.6362912openalex-snapshot
Broadcasting with coded side information
inferred← citeshttps://doi.org/10.1109/pimrc.2017.8292448openalex-snapshot
Optimal linear error-correcting index codes for some generalized index coding problems
inferred← citeshttps://doi.org/10.1109/redundancy48165.2019.9003326openalex-snapshot
Unicast-Uniprior Index Coding Problems: Minrank and Criticality
inferred← citeshttps://doi.org/10.1109/tcomm.2018.2789457openalex-snapshot
Binary Informed Source Codes and Index Codes Using Certain Near-MDS Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2018.2877392openalex-snapshot
Multi-Sender Index Coding for Collaborative Broadcasting: A Rank-Minimization Approach
inferred← citeshttps://doi.org/10.1109/tcomm.2019.2916556openalex-snapshot
Error Correction in Coded Caching With Symmetric Batch Prefetching
inferred← citeshttps://doi.org/10.1109/tcomm.2020.2982625openalex-snapshot
Optimization of Two-Way Network Coded HARQ With Overhead
inferred← citeshttps://doi.org/10.1109/tcomm.2023.3280554openalex-snapshot
Strategies for Optimal Transmission and Delay Reduction in Dynamic Index Coding Problem
inferred← citeshttps://doi.org/10.1109/tit.2010.2048502openalex-snapshot
On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
inferred← citeshttps://doi.org/10.1109/tit.2010.2094910openalex-snapshot
On the Hardness of Approximating the Network Coding Capacity
inferred← citeshttps://doi.org/10.1109/tit.2010.2103753openalex-snapshot
Index Coding With Side Information
inferred← citeshttps://doi.org/10.1109/tit.2011.2178017openalex-snapshot
Rank Minimization Over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations
inferred← citeshttps://doi.org/10.1109/tit.2012.2188777openalex-snapshot
On the Security of Index Coding With Side Information
inferred← citeshttps://doi.org/10.1109/tit.2012.2221677openalex-snapshot
Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number
inferred← citeshttps://doi.org/10.1109/tit.2012.2227674openalex-snapshot
Error Correction for Index Coding With Side Information
inferred← citeshttps://doi.org/10.1109/tit.2013.2295331openalex-snapshot
Optimal Index Codes With Near-Extreme Rates
inferred← citeshttps://doi.org/10.1109/tit.2014.2349502openalex-snapshot
Bounds on Entanglement-Assisted Source-Channel Coding via the Lovász \(\vartheta \) Number and Its Variants
inferred← citeshttps://doi.org/10.1109/tit.2014.2354044openalex-snapshot
Duality Codes and the Integrality Gap Bound for Index Coding
inferred← citeshttps://doi.org/10.1109/tit.2016.2536612openalex-snapshot
Linear Network Coding for Erasure Broadcast Channel With Feedback: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1109/tit.2016.2553676openalex-snapshot
Alignment-Based Network Coding for Two-Unicast-Z Networks
inferred← citeshttps://doi.org/10.1109/tit.2017.2662706openalex-snapshot
Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques
inferred← citeshttps://doi.org/10.1109/tit.2017.2687933openalex-snapshot
Error Correction for Index Coding With Coded Side Information
inferred← citeshttps://doi.org/10.1109/tit.2017.2743688openalex-snapshot
Perfectly Secure Index Coding
inferred← citeshttps://doi.org/10.1109/tit.2017.2748562openalex-snapshot
Optimal Finite-Length and Asymptotic Index Codes for Five or Fewer Receivers
inferred← citeshttps://doi.org/10.1109/tit.2017.2752088openalex-snapshot
A Polynomial-Time Algorithm for Pliable Index Coding
inferred← citeshttps://doi.org/10.1109/tit.2020.2990822openalex-snapshot
Task-Based Solutions to Embedded Index Coding
inferred← citeshttps://doi.org/10.1109/tit.2023.3347296openalex-snapshot
Hardness of Linear Index Coding on Perturbed Instances
inferred← citeshttps://doi.org/10.1109/tit.2024.3392685openalex-snapshot
The Capacity of 3 User Linear Computation Broadcast
inferred← citeshttps://doi.org/10.1109/tvt.2016.2639027openalex-snapshot
Probabilistic Models and Algorithms for Data Synchronization/Broadcast Via Network Coding
inferred← citeshttps://doi.org/10.1109/tvt.2022.3175785openalex-snapshot
Embedded Index Coding With Consecutive Side Information in Vehicle to Vehicle Communication
inferred← citeshttps://doi.org/10.1109/twc.2014.2330571openalex-snapshot
Data Dissemination With Side Information and Feedback
inferred← citeshttps://doi.org/10.1137/16m107164xopenalex-snapshot
Bounding the Optimal Rate of the ICSI and ICCSI problem
inferred← citeshttps://doi.org/10.1137/19m1295921openalex-snapshot
Topological Bounds for Graph Representations over Any Field
inferred← citeshttps://doi.org/10.1137/23m155760xopenalex-snapshot
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
inferred← citeshttps://doi.org/10.1145/2488608.2488693openalex-snapshot
Low-rank matrix completion using alternating minimization
inferred← citeshttps://doi.org/10.1145/2897518.2897639openalex-snapshot
Weighted low rank approximations with provable guarantees
inferred← citeshttps://doi.org/10.1145/3188745.3188832openalex-snapshot
Generalized matrix completion and algebraic natural proofs
inferred← citeshttps://doi.org/10.1184/r1/6716282openalex-snapshot
Entanglement and Interference Resources in Quantum Computation and Communication
inferred← citeshttps://doi.org/10.1609/aaai.v34i04.5804openalex-snapshot
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank
inferred← citeshttps://doi.org/10.2140/tunis.2024.6.543openalex-snapshot
Triangular ranks do not bound minimum ranks in matrix completion
inferred← citeshttps://doi.org/10.22331/q-2020-08-14-308openalex-snapshot
Gadget structures in proofs of the Kochen-Specker theorem
inferred← citeshttps://doi.org/10.32657/10356/48642openalex-snapshot
On index coding with side information
inferred← citeshttps://doi.org/10.3390/e24081149openalex-snapshot
Index Coding with Multiple Interpretations
inferred← citeshttps://doi.org/10.37236/10765openalex-snapshot
On the Subspace Choosability in Graphs
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2021.8openalex-snapshot
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2019.39openalex-snapshot
Approximating the Orthogonality Dimension of Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.4230/lipics.tqc.2014.48openalex-snapshot
Bounds on Entanglement Assisted Source-channel Coding Via the Lovász Theta Number and Its Variants
inferred← citeshttps://doi.org/10.4230/lipics.tqc.2015.206openalex-snapshot
Round Elimination in Exact Communication Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1402.2331openalex-snapshot
Computational Limits for Matrix Completion
inferred← citeshttps://doi.org/10.48550/arxiv.2104.10668openalex-snapshot
On the rank of Z_2-matrices with free entries on the diagonal
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.