The following pages link to Magnús M. Halldórsson (Q235185):
Displaying 50 items.
- Nearly optimal bounds for distributed wireless scheduling in the SINR model (Q287982) (← links)
- Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907) (← links)
- Streaming algorithms for independent sets in sparse hypergraphs (Q329293) (← links)
- Max point-tolerance graphs (Q344833) (← links)
- The minimum vulnerability problem on specific graph classes (Q346526) (← links)
- Online scheduling with interval conflicts (Q372978) (← links)
- Online selection of intervals and \(t\)-intervals (Q391644) (← links)
- Online coloring of hypergraphs (Q656575) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- Approximating the minimum maximal independence number (Q685520) (← links)
- Approximating the tree and tour covers of a graph (Q688437) (← links)
- Wireless capacity with arbitrary gain matrix (Q742412) (← links)
- Generalized disk graphs (Q832849) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- On the complexity of the shortest-path broadcast problem (Q896659) (← links)
- Semi-transitive orientations and word-representable graphs (Q908303) (← links)
- Minimizing interference of a wireless ad-hoc network in a plane (Q936528) (← links)
- Vertex coloring acyclic digraphs and their corresponding hypergraphs (Q944747) (← links)
- Complete partitions of graphs (Q949754) (← links)
- Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
- Approximation algorithms for the weighted independent set problem in sparse graphs (Q1028454) (← links)
- Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) (← links)
- Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth (Q1041722) (← links)
- Approximating maximum independent sets by excluding subgraphs (Q1196452) (← links)
- A still better performance guarantee for approximate graph coloring (Q1209311) (← links)
- (Q1331950) (redirect page) (← links)
- Lower bounds for on-line graph coloring (Q1331951) (← links)
- On chromatic sums and distributed resource allocation (Q1383159) (← links)
- Multicoloring trees. (Q1401922) (← links)
- Powers of geometric intersection graphs and dispersion algorithms (Q1414578) (← links)
- Approximation algorithms for the test cover problem (Q1424310) (← links)
- Approximability results for stable marriage problems with ties. (Q1426466) (← links)
- On the approximation of largest common subtrees and largest common point sets (Q1575954) (← links)
- A matched approximation bound for the sum of a greedy coloring (Q1606980) (← links)
- Distributed large independent sets in one round on bounded-independence graphs (Q1664165) (← links)
- Computing large independent sets in a single round (Q1699422) (← links)
- Distributed approximation of \(k\)-service assignment (Q1733389) (← links)
- Distributed backup placement in networks (Q1741963) (← links)
- Online independent sets. (Q1853575) (← links)
- Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs (Q1879365) (← links)
- Randomized approximation of the stable marriage problem (Q1884845) (← links)
- SDP-based algorithms for maximum independent set problems on hypergraphs (Q1935808) (← links)
- Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees (Q1935809) (← links)
- Independent sets with domination constraints (Q1962033) (← links)
- Online coloring known graphs (Q1967115) (← links)
- Wireless network algorithmics (Q2075769) (← links)
- Tight bounds on subexponential time approximation of set cover and related problems (Q2117696) (← links)
- Radio aggregation scheduling (Q2202004) (← links)
- Limitations of current wireless link scheduling algorithms (Q2202005) (← links)
- Computing inductive vertex orderings (Q2234785) (← links)
