On the public citation graph
Greed is good: Approximating independent sets in sparse and bounded-degree graphs
0 signed · 274 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/3-540-58218-5_18openalex-snapshot
Improved approximations of independent sets in bounded-degree graphs
inferredcites →https://doi.org/10.1007/3-540-60220-8_84openalex-snapshot
On approximation properties of the Independent set problem for degree 3 graphs
inferredcites →https://doi.org/10.1007/bf01580444openalex-snapshot
Vertex packings: Structural properties and algorithms
inferredcites →https://doi.org/10.1007/bfb0015418openalex-snapshot
Greedy approximations of independent sets in low degree graphs
inferredcites →https://doi.org/10.1016/0012-365x(83)90273-xopenalex-snapshot
A note on the independence number of triangle-free graphs
inferredcites →https://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot
Optimization, approximation, and complexity classes
inferredcites →https://doi.org/10.1016/0095-8956(75)90089-1openalex-snapshot
Three short proofs in graph theory
inferredcites →https://doi.org/10.1016/0095-8956(83)90003-5openalex-snapshot
Lower bounds on the independence number in terms of the degrees
inferredcites →https://doi.org/10.1016/0166-218x(83)90080-xopenalex-snapshot
Efficient bounds for the stable set, vertex cover and set packing problems
inferredcites →https://doi.org/10.1017/s030500410002168xopenalex-snapshot
On colouring the nodes of a network
inferredcites →https://doi.org/10.1109/sfcs.1992.267823openalex-snapshot
Proof verification and hardness of approximation problems
inferredcites →https://doi.org/10.1109/sfcs.1994.365712openalex-snapshot
On syntactic versus computational views of approximability
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/0221015openalex-snapshot
Locality in Distributed Graph Algorithms
inferredcites →https://doi.org/10.1137/0401044openalex-snapshot
Parallel Symmetry-Breaking in Sparse Graphs
inferredcites →https://doi.org/10.1137/0403025openalex-snapshot
On Approximate Solutions for Combinatorial Optimization Problems
inferredcites →https://doi.org/10.5555/314464.314570openalex-snapshot
Approximating maximum independent set in bounded degree graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0146openalex-snapshot
Maximum Clique, Maximum Independent Set, and Graph Coloring Problems
inferred← citeshttps://doi.org/10.1002/cpe.6681openalex-snapshot
Simple iterative trial search for the maximum independent set problem optimized for the GPUs
inferred← citeshttps://doi.org/10.1002/rsa.20165openalex-snapshot
Packing vertices and edges in random regular graphs
inferred← citeshttps://doi.org/10.1002/rsa.20492openalex-snapshot
Recoverable values for independent sets
inferred← citeshttps://doi.org/10.1006/jagm.1998.0938openalex-snapshot
Minimum Color Sum of Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/11427186_44openalex-snapshot
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs
inferred← citeshttps://doi.org/10.1007/11533719_85openalex-snapshot
Distributed Weighted Vertex Cover via Maximal Matchings
inferred← citeshttps://doi.org/10.1007/11602613_44openalex-snapshot
On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems
inferred← citeshttps://doi.org/10.1007/11604686_30openalex-snapshot
Approximation Algorithms for the Weighted Independent Set Problem
inferred← citeshttps://doi.org/10.1007/11816157_99openalex-snapshot
An Improved Simulated Annealing Algorithm for the Maximum Independent Set Problem
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_25openalex-snapshot
On the Hardness of Approximating Minimum Monopoly Problems
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_12openalex-snapshot
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_26openalex-snapshot
Approximations of Weighted Independent Set and Hereditary Subset Problems
inferred← citeshttps://doi.org/10.1007/3-540-63890-3_43openalex-snapshot
Competitive call control in mobile networks
inferred← citeshttps://doi.org/10.1007/978-2-287-99037-3_16openalex-snapshot
Algorithmes d’approximation
inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_12openalex-snapshot
Simple and Local Independent Set Approximation
inferred← citeshttps://doi.org/10.1007/978-3-030-39479-0_14openalex-snapshot
Improved (In-)Approximability Bounds for d-Scattered Set
inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_20openalex-snapshot
On the Maximum Edge-Pair Embedding Bipartite Matching
inferred← citeshttps://doi.org/10.1007/978-3-030-51054-1_17openalex-snapshot
Verified Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-77967-2_5openalex-snapshot
Exact Searching for the Smallest Deterministic Automaton
inferred← citeshttps://doi.org/10.1007/978-3-030-80879-2_3openalex-snapshot
Distributed Algorithms for Matching in Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_17openalex-snapshot
Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-57712-3_7openalex-snapshot
Greedy Heuristic Guided by Lexicographic Excellence
inferred← citeshttps://doi.org/10.1007/978-3-319-07401-6_24openalex-snapshot
On the Growth of Large Independent Sets in Scale-Free Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-07959-2_4openalex-snapshot
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-09952-1_7openalex-snapshot
Can Frogs Find Large Independent Sets in a Decentralized Way? Yes They Can!
inferred← citeshttps://doi.org/10.1007/978-3-319-27051-7_38openalex-snapshot
Performance Analysis of (1+1)EA on the Maximum Independent Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-31204-0_7openalex-snapshot
On Combinatorial Optimisation in Analysis of Protein-Protein Interaction and Protein Folding Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-39552-4_4openalex-snapshot
Dynamics and Statistics of Poisson-Driven LIF Neurons
inferred← citeshttps://doi.org/10.1007/978-3-319-48749-6_20openalex-snapshot
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-72926-8_44openalex-snapshot
Finding Smooth Graphs with Small Independence Numbers
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_38openalex-snapshot
When is Red-Blue Nonblocker Fixed-Parameter Tractable?
inferred← citeshttps://doi.org/10.1007/978-3-319-96151-4_9openalex-snapshot
Approximating the Caro-Wei Bound for Independent Sets in Graph Streams
inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_22openalex-snapshot
A Modern View on Stability of Approximation
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_16openalex-snapshot
Approximated Vertex Cover for Graphs with Perfect Matchings
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_18openalex-snapshot
On Approximation Hardness of the Minimum 2SAT-DELETION Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-71844-4_16openalex-snapshot
Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_24openalex-snapshot
Independent Sets in Bounded-Degree Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-76919-4_16openalex-snapshot
Approximationsalgorithmen
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_53openalex-snapshot
Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_35openalex-snapshot
Combining Two Worlds: Parameterised Approximation for Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-642-18381-2_12openalex-snapshot
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_41openalex-snapshot
Recoverable Values for Independent Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_42openalex-snapshot
Vertex Cover in Graphs with Locally Few Colors
inferred← citeshttps://doi.org/10.1007/978-3-642-22212-2_22openalex-snapshot
Distributed Coloring Depending on the Chromatic Number or the Neighborhood Growth
inferred← citeshttps://doi.org/10.1007/978-3-642-24488-9_16openalex-snapshot
Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_16openalex-snapshot
Approximationsalgorithmen
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_18openalex-snapshot
Generalizing Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-39247-4_12openalex-snapshot
Exploring and Making Safe Dangerous Networks Using Mobile Entities
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_8openalex-snapshot
Filtering AtMostNValue with Difference Constraints: Application to the Shift Minimisation Personnel Task Scheduling Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-21708-5_16openalex-snapshot
Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-21711-5_16openalex-snapshot
Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_38openalex-snapshot
MapSets: Visualizing Embedded and Clustered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-56039-6_16openalex-snapshot
Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_16openalex-snapshot
Approximationsalgorithmen
inferred← citeshttps://doi.org/10.1007/978-3-8351-9067-2_3openalex-snapshot
Approximation mit relativer Gütegarantie
inferred← citeshttps://doi.org/10.1007/978-981-96-8312-3_3openalex-snapshot
Comparing the Hardness of Online Minimization and Maximization Problems with Predictions
inferred← citeshttps://doi.org/10.1007/bfb0040790openalex-snapshot
Evolutionary algorithms for vertex cover
inferred← citeshttps://doi.org/10.1007/bfb0053959openalex-snapshot
Approximations of independent sets in graphs
inferred← citeshttps://doi.org/10.1007/bfb0053972openalex-snapshot
Approximating maximum independent set in k-clique-free graphs
inferred← citeshttps://doi.org/10.1007/bfb0055806openalex-snapshot
Approximating maximum independent sets in uniform hypergraphs
inferred← citeshttps://doi.org/10.1007/s00224-011-9371-2openalex-snapshot
Minimum Entropy Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1007/s00224-020-10027-4openalex-snapshot
Approximability of open k-monopoly problems
inferred← citeshttps://doi.org/10.1007/s00439-016-1698-yopenalex-snapshot
The genetic history of Cochin Jews from India
inferred← citeshttps://doi.org/10.1007/s00453-012-9629-3openalex-snapshot
Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
inferred← citeshttps://doi.org/10.1007/s00453-024-01268-7openalex-snapshot
Ultimate Greedy Approximation of Independent Sets in Subcubic Graphs
inferred← citeshttps://doi.org/10.1007/s00500-018-3230-xopenalex-snapshot
GraphCombEx: a software tool for exploration of combinatorial optimisation properties of large graphs
inferred← citeshttps://doi.org/10.1007/s00778-012-0285-7openalex-snapshot
Comparable dependencies over heterogeneous data
inferred← citeshttps://doi.org/10.1007/s00778-020-00602-zopenalex-snapshot
Efficient maximum clique computation and enumeration over large sparse graphs
inferred← citeshttps://doi.org/10.1007/s10107-011-0451-5openalex-snapshot
On linear and semidefinite programming relaxations for hypergraph matching
inferred← citeshttps://doi.org/10.1007/s10618-005-0003-9openalex-snapshot
Finding Frequent Patterns in a Large Sparse Graph*
inferred← citeshttps://doi.org/10.1007/s11235-022-00924-zopenalex-snapshot
Inter-cell interference in multi-tier heterogeneous cellular networks: modeling and constraints
inferred← citeshttps://doi.org/10.1007/s11721-015-0110-1openalex-snapshot
FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs
inferred← citeshttps://doi.org/10.1007/s13369-014-1159-7openalex-snapshot
Maximum Independent Set Approximation Based on Bellman-Ford Algorithm
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00072-5openalex-snapshot
Independent sets in graphs with triangles
inferred← citeshttps://doi.org/10.1016/j.adhoc.2015.08.004openalex-snapshot
Maximum lifetime dependable barrier-coverage in wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.artint.2014.04.001openalex-snapshot
Filtering AtMostNValue with difference constraints: Application to the shift minimisation personnel task scheduling problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2022.109607openalex-snapshot
Stochastic simulated annealing for directed feedback vertex set
inferred← citeshttps://doi.org/10.1016/j.comcom.2018.07.029openalex-snapshot
Throughput optimal random medium access control for relay networks with time-varying channels
inferred← citeshttps://doi.org/10.1016/j.comcom.2022.12.025openalex-snapshot
Mobility Aware Resource Allocation for Millimeter-Wave D2d Communications in Presence of Obstacles
inferred← citeshttps://doi.org/10.1016/j.comnet.2019.01.008openalex-snapshot
Detecting wormhole attacks in 3D wireless ad hoc networks via 3D forbidden substructures
inferred← citeshttps://doi.org/10.1016/j.dam.2006.04.039openalex-snapshot
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover
inferred← citeshttps://doi.org/10.1016/j.dam.2008.08.027openalex-snapshot
Approximation algorithms for the weighted independent set problem in sparse graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.11.013openalex-snapshot
Independent sets in bounded-degree hypergraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.01.006openalex-snapshot
Bounding the feedback vertex number of digraphs in terms of vertex degrees
inferred← citeshttps://doi.org/10.1016/j.dam.2011.04.023openalex-snapshot
The complexity of dissociation set problems in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.11.002openalex-snapshot
Computing convex quadrangulations
inferred← citeshttps://doi.org/10.1016/j.dam.2013.12.011openalex-snapshot
New potential functions for greedy independence and coloring
inferred← citeshttps://doi.org/10.1016/j.dam.2021.12.027openalex-snapshot
Maximum 0-1 timed matching on temporal graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.09.009openalex-snapshot
Approximation ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2011.04.001openalex-snapshot
On the complexity of the independent set problem in triangle graphs
inferred← citeshttps://doi.org/10.1016/j.dss.2018.03.008openalex-snapshot
A visual analytics system to support tax evasion discovery
inferred← citeshttps://doi.org/10.1016/j.ic.2011.12.008openalex-snapshot
Vertex cover in graphs with locally few colors
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.01.009openalex-snapshot
A note on the Greedy algorithm for finding independent sets of -free graphs
inferred← citeshttps://doi.org/10.1016/j.jestch.2025.101995openalex-snapshot
A greedy approach to solve maximum independent set problem: Differential Malatya independent set algorithm
inferred← citeshttps://doi.org/10.1016/j.jides.2015.02.005openalex-snapshot
Co-locating services in IoT systems to minimize the communication energy cost
inferred← citeshttps://doi.org/10.1016/j.socnet.2024.10.002openalex-snapshot
Estimating policy effects in a social network with independent set sampling
inferred← citeshttps://doi.org/10.1016/j.spa.2020.09.009openalex-snapshot
Asymptotic optimality of degree-greedy discovering of independent sets in Configuration Model graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.12.034openalex-snapshot
On approximating minimum vertex cover for graphs with perfect matching
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.10.037openalex-snapshot
Reoptimization of maximum weight induced hereditary subgraph problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.003openalex-snapshot
A novel parameterised approximation algorithm for minimum vertex cover
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.09.002openalex-snapshot
Explore and repair graphs with black holes using mobile entities
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.02.022openalex-snapshot
Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.08.022openalex-snapshot
Combinatorial properties of Farey graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.06.018openalex-snapshot
On the maximum edge-pair embedding bipartite matching
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00205-6openalex-snapshot
A note on greedy algorithms for the maximum weighted independent set problem
inferred← citeshttps://doi.org/10.1016/s0893-9659(97)00044-xopenalex-snapshot
Improved approximations for maximum independent set via approximation chains
inferred← citeshttps://doi.org/10.1017/s0963548309990186openalex-snapshot
Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections
inferred← citeshttps://doi.org/10.1051/ita:2006012openalex-snapshot
Solving maximum independent set by asynchronous distributed hopfield-type neural networks
inferred← citeshttps://doi.org/10.1051/ro/2011114openalex-snapshot
A survey on combinatorial optimization in dynamic environments
inferred← citeshttps://doi.org/10.1073/pnas.2212323120openalex-snapshot
Solving independent set problems with photonic quantum circuits
inferred← citeshttps://doi.org/10.1080/08839514.2017.1279110openalex-snapshot
Polynomial and Extensible Solutions in Lock-Chart Solving
inferred← citeshttps://doi.org/10.1093/comjnl/bxab007openalex-snapshot
Some Combinatorial Problems in Power-Law Graphs
inferred← citeshttps://doi.org/10.1093/ietisy/e89-d.8.2405openalex-snapshot
Approximated Vertex Cover for Graphs with Perfect Matchings
inferred← citeshttps://doi.org/10.1093/jigpal/jzad014openalex-snapshot
Report on the exact methods for finding minimum-sized DFA
inferred← citeshttps://doi.org/10.1093/nargab/lqad088openalex-snapshot
GraphPart: homology partitioning for biological sequence analysis
inferred← citeshttps://doi.org/10.1103/physreva.108.052423openalex-snapshot
Exploring the impact of graph locality for the resolution of the maximum- independent-set problem with neutral atom devices
inferred← citeshttps://doi.org/10.1103/physreve.100.013302openalex-snapshot
Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs
inferred← citeshttps://doi.org/10.1103/prxquantum.5.020327openalex-snapshot
Quantum-Informed Recursive Optimization Algorithms
inferred← citeshttps://doi.org/10.1109/access.2018.2877404openalex-snapshot
Fault-Tolerant Topology Control Towards ${K}$ -Channel-Connectivity in Cognitive Radio Networks
inferred← citeshttps://doi.org/10.1109/aimsec.2011.6010743openalex-snapshot
Cognitive radio link scheduling and power control joint algorithm
inferred← citeshttps://doi.org/10.1109/bigdata.2015.7363856openalex-snapshot
Efficient distributed maximum matching for solving the container exchange problem in the maritime industry
inferred← citeshttps://doi.org/10.1109/candar51075.2020.00012openalex-snapshot
Efficient GPU Implementation for Solving the Maximum Independent Set Problem
inferred← citeshttps://doi.org/10.1109/ciss.2008.4558579openalex-snapshot
Throughput of random access without message passing
inferred← citeshttps://doi.org/10.1109/dcoss.2013.12openalex-snapshot
Model-Driven Accuracy Bounds for Noisy Sensor Readings
inferred← citeshttps://doi.org/10.1109/futuretech.2010.5482719openalex-snapshot
Architecture-Aware Graph-Covering Algorithm for Custom Instruction Selection
inferred← citeshttps://doi.org/10.1109/glocom.2010.5683702openalex-snapshot
Integrated Power Controlled Adaptive Rate Link Scheduling in Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/glocom.2011.6133531openalex-snapshot
Distributive Power Control and Rate Adaptation Link Scheduling in Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/icc.2015.7249136openalex-snapshot
Cell-Centric and User-Centric Multi-User Scheduling in Visible Light Communication aided networks
inferred← citeshttps://doi.org/10.1109/iccad.1996.569540openalex-snapshot
Exploiting regularity for low-power design
inferred← citeshttps://doi.org/10.1109/icccas.2007.6250852openalex-snapshot
Joint link scheduling and power control for Multichannel Multihop Cognitive radio networks
inferred← citeshttps://doi.org/10.1109/iccci50826.2021.9402440openalex-snapshot
Priority Assignment Algorithms for Maximum Protection Ratio in Shared Mesh Protection
inferred← citeshttps://doi.org/10.1109/icccn54977.2022.9868862openalex-snapshot
Intelligent Reflecting Surface-Aided Centralized Scheduling for mmWave V2V Networks
inferred← citeshttps://doi.org/10.1109/iccnc.2013.6504245openalex-snapshot
Elastic optical networking and low-latency high-radix optical switches for future cloud computing
inferred← citeshttps://doi.org/10.1109/icctet.2013.6675934openalex-snapshot
A vigorous distributive approach to adaptive link scheduling in Mobile Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1109/iccubea65967.2025.11283126openalex-snapshot
Graph Coloring with Approximation Ratios: A Survey of Performance Bounds and Open Problems
inferred← citeshttps://doi.org/10.1109/icde.2011.5767857openalex-snapshot
On data dependencies in dataspaces
inferred← citeshttps://doi.org/10.1109/icde.2019.00016openalex-snapshot
Computing a Near-Maximum Independent Set in Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00050openalex-snapshot
Assessing the Existence of a Function in a Dataset with the g3 Indicator
inferred← citeshttps://doi.org/10.1109/icdm.2004.10024openalex-snapshot
GREW-A Scalable Frequent Subgraph Discovery Algorithm
inferred← citeshttps://doi.org/10.1109/iwcmc.2012.6314382openalex-snapshot
Throughput-constrained scheduling in OFDMA wireless networks
inferred← citeshttps://doi.org/10.1109/jsac.2013.130105openalex-snapshot
Adaptive Spectrum Control and Management in Elastic Optical Networks
inferred← citeshttps://doi.org/10.1109/ondm.2012.6210261openalex-snapshot
Intra and inter datacenter networking: The role of optical packet switching and flexible bandwidth optical networking
inferred← citeshttps://doi.org/10.1109/pdcat.2009.15openalex-snapshot
Heuristic Certificates via Approximations
inferred← citeshttps://doi.org/10.1109/pimrc.2013.6666385openalex-snapshot
Resource allocation for load minimization jointly with admission control in OFDMA wireless networks
inferred← citeshttps://doi.org/10.1109/tcad.2020.3016281openalex-snapshot
SeFAct2: Selective Feature Activation for Energy-Efficient CNNs Using Optimized Thresholds
inferred← citeshttps://doi.org/10.1109/tcomm.2017.2773529openalex-snapshot
Device-to-Device Communications Enabled Energy Efficient Multicast Scheduling in mmWave Small Cells
inferred← citeshttps://doi.org/10.1109/tcomm.2018.2884988openalex-snapshot
Priority Assignment Algorithms for Shared Mesh Protection Switching
inferred← citeshttps://doi.org/10.1109/tkde.2021.3073983openalex-snapshot
Centralized Routing for Bike-sharing Systems
inferred← citeshttps://doi.org/10.1109/tmc.2004.44openalex-snapshot
Multiple access protocol for power-controlled wireless access nets
inferred← citeshttps://doi.org/10.1109/tmc.2005.90openalex-snapshot
Subcarrier allocation and bit loading algorithms for OFDMA-based wireless networks
inferred← citeshttps://doi.org/10.1109/tnet.2010.2089534openalex-snapshot
Improved Bounds on the Throughput Efficiency of Greedy Maximal Scheduling in Wireless Networks
inferred← citeshttps://doi.org/10.1109/tnet.2018.2867156openalex-snapshot
Breach-Free Sleep-Wakeup Scheduling for Barrier Coverage With Heterogeneous Wireless Sensors
inferred← citeshttps://doi.org/10.1109/tqe.2024.3443660openalex-snapshot
Solving Nonnative Combinatorial Optimization Problems Using Hybrid Quantum–Classical Algorithms
inferred← citeshttps://doi.org/10.1109/trustcom-bigdatase-ispa.2015.607openalex-snapshot
Selfish Self-Stabilizing Approach to Maximal Independent Sets
inferred← citeshttps://doi.org/10.1109/trustcom.2015.607openalex-snapshot
Selfish Self-Stabilizing Approach to Maximal Independent Sets
inferred← citeshttps://doi.org/10.1109/tsg.2016.2639445openalex-snapshot
SoH-Aware Reconfiguration in Battery Packs
inferred← citeshttps://doi.org/10.1109/tvt.2006.883734openalex-snapshot
Optimum Integrated Link Scheduling and Power Control for Multihop Wireless Networks
inferred← citeshttps://doi.org/10.1109/twc.2010.07.091616openalex-snapshot
Integrated Power Controlled Rate Adaptation and Medium Access Control in Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/twc.2011.110811.110290openalex-snapshot
A Robust Distributive Approach to Adaptive Power and Adaptive Rate Link Scheduling in Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/twc.2015.2466539openalex-snapshot
Users First: User-Centric Cluster Formation for Interference-Mitigation in Visible-Light Networks
inferred← citeshttps://doi.org/10.1109/vetecs.2008.397openalex-snapshot
Spokesmen Election Problem Revisited
inferred← citeshttps://doi.org/10.1109/wimob.2005.1512914openalex-snapshot
Optimum integrated link scheduling and power control for ad hoc wireless networks
inferred← citeshttps://doi.org/10.1111/itor.12619openalex-snapshot
An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†
inferred← citeshttps://doi.org/10.1137/1.9781611972740.32openalex-snapshot
Finding Frequent Patterns in a Large Sparse Graph
inferred← citeshttps://doi.org/10.1137/1.9781611975994.87openalex-snapshot
Ultimate greedy approximation of independent sets in subcubic graphs
inferred← citeshttps://doi.org/10.1137/s0097539700381097openalex-snapshot
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.1137/s0097539797323716openalex-snapshot
The Algorithmic Aspects of Uncrowded Hypergraphs
inferred← citeshttps://doi.org/10.1137/s0895480100379579openalex-snapshot
On Approximating the Achromatic Number
inferred← citeshttps://doi.org/10.1145/1435375.1435381openalex-snapshot
Distributed weighted vertex cover via maximal matchings
inferred← citeshttps://doi.org/10.1145/1530748.1530771openalex-snapshot
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
inferred← citeshttps://doi.org/10.1145/1671970.1865971openalex-snapshot
Analytical and experimental comparison of six algorithms for the vertex cover problem
inferred← citeshttps://doi.org/10.1145/2851492openalex-snapshot
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs
inferred← citeshttps://doi.org/10.1145/2957760openalex-snapshot
Designing Self-Stabilizing Systems Using Game Theory
inferred← citeshttps://doi.org/10.1145/2988458.2988473openalex-snapshot
Data-driven shape analysis and processing
inferred← citeshttps://doi.org/10.1145/3035918.3035939openalex-snapshot
Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling
inferred← citeshttps://doi.org/10.1145/3087801.3087806openalex-snapshot
Distributed Approximation of Maximum Independent Set and Maximum Matching
inferred← citeshttps://doi.org/10.1145/3241049openalex-snapshot
Energy-Efficient Real-Time Scheduling of DAG Tasks
inferred← citeshttps://doi.org/10.1145/3397166.3409135openalex-snapshot
Data inference from encrypted databases
inferred← citeshttps://doi.org/10.1145/345910.345923openalex-snapshot
A new model for packet scheduling in multihop wireless networks
inferred← citeshttps://doi.org/10.1145/3533770openalex-snapshot
Detecting Anomalous Graphs in Labeled Multi-Graph Databases
inferred← citeshttps://doi.org/10.1145/3678178openalex-snapshot
MedNER: Enhanced Named Entity Recognition in Medical Corpus via Optimized Balanced and Deep Active Learning
inferred← citeshttps://doi.org/10.1145/3742476openalex-snapshot
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond
inferred← citeshttps://doi.org/10.1145/3800938openalex-snapshot
Computing the g3-error with Relaxed Equality: Complexity, Algorithms and Visualization
inferred← citeshttps://doi.org/10.11606/d.45.2010.tde-13092010-093911openalex-snapshot
O problema da subsequência comum máxima sem repetições
inferred← citeshttps://doi.org/10.1162/neco_a_01365openalex-snapshot
A Generalization of Spatial Monte Carlo Integration
inferred← citeshttps://doi.org/10.1186/1471-2105-12-29openalex-snapshot
Investigating the effect of paralogs on microarray gene-set analysis
inferred← citeshttps://doi.org/10.1186/1687-1499-2012-250openalex-snapshot
Joint scheduling and power control for multicasting in cellular wireless networks
inferred← citeshttps://doi.org/10.1186/s40649-021-00086-zopenalex-snapshot
Gumbel-softmax-based optimization: a simple general framework for optimization problems on graphs
inferred← citeshttps://doi.org/10.1287/moor.2022.0215openalex-snapshot
Large Independent Sets in Recursive Markov Random Graphs
inferred← citeshttps://doi.org/10.1364/oe.20.001798openalex-snapshot
Dynamic on-demand defragmentation in flexible bandwidth elastic optical networks
inferred← citeshttps://doi.org/10.1364/oe.23.002737openalex-snapshot
Scheduling for indoor visible light communication based on graph theory
inferred← citeshttps://doi.org/10.1364/oe.392353openalex-snapshot
Graph-based multi-user scheduling for indoor cooperative visible light transmission
inferred← citeshttps://doi.org/10.1371/journal.pone.0152056openalex-snapshot
The Genetics of Bene Israel from India Reveals Both Substantial Jewish and Indian Ancestry
inferred← citeshttps://doi.org/10.14257/ijast.2014.67.07openalex-snapshot
AVSA, Modified Vertex Support Algorithm for Approximation of MVC
showing the first 200 of 254 · page through all 254
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.