Pages that link to "Item:Q185429"
From MaRDI portal
The following pages link to Journal of Combinatorial Optimization (Q185429):
Displaying 50 items.
- Partial degree bounded edge packing problem for graphs and \(k\)-uniform hypergraphs (Q328705) (← links)
- Strong minimum energy hierarchical topology in wireless sensor networks (Q328707) (← links)
- List edge and list total coloring of planar graphs with maximum degree 8 (Q328709) (← links)
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) (← links)
- 2-distance coloring of a planar graph without 3, 4, 7-cycles (Q328716) (← links)
- Upper bounds for the total rainbow connection of graphs (Q328717) (← links)
- Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs (Q328720) (← links)
- Distributed wireless link scheduling in the SINR model (Q328722) (← links)
- On strongly planar 3SAT (Q328723) (← links)
- Signed mixed Roman domination numbers in graphs (Q328725) (← links)
- Complete forcing numbers of primitive coronoids (Q328729) (← links)
- Preface: Special issue on computing and combinatorics conference and wireless algorithms, systems, and applications conference (Q346474) (← links)
- \((\alpha,\tau )\)-monitoring for event detection in wireless sensor networks (Q346476) (← links)
- Approximate event detection over multi-modal sensing data (Q346477) (← links)
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
- On the performance of mildly greedy players in cut games (Q346481) (← links)
- An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models (Q346485) (← links)
- Efficient accuracy evaluation for multi-modal sensed data (Q346487) (← links)
- Directed Steiner trees with diffusion costs (Q346492) (← links)
- Enabling high-dimensional range queries using \(k\)NN indexing techniques: approaches and empirical results (Q346495) (← links)
- Approximate sorting of data streams with limited storage (Q346499) (← links)
- Exemplar or matching: modeling DCJ problems with unequal content genome data (Q346504) (← links)
- Reconfiguration of dominating sets (Q346508) (← links)
- Editorial for special issue: COCOA2014 (Q346509) (← links)
- Towards the price of leasing online (Q346515) (← links)
- Approximation schemes for Euclidean vehicle routing problems with time windows (Q346518) (← links)
- Serve or skip: the power of rejection in online bottleneck matching (Q346521) (← links)
- Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing (Q346522) (← links)
- The minimum vulnerability problem on specific graph classes (Q346526) (← links)
- The popular matching and condensation problems under matroid constraints (Q346527) (← links)
- A practical greedy approximation for the directed Steiner tree problem (Q346528) (← links)
- Integer programming methods for special college admissions problems (Q346530) (← links)
- Special issue: Approximation algorithms for geometric and combinatorial problems. Selected papers based on the presentations at the AAIM 2011 (Q353498) (← links)
- The three-dimensional matching problem in kalmanson matrices (Q358634) (← links)
- Optimal key tree structure for two-user replacement and deletion problems (Q358638) (← links)
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\) (Q358639) (← links)
- Approximate min-max relations on plane graphs (Q358640) (← links)
- On the outer-connected domination in graphs (Q358644) (← links)
- Independent dominating sets in regular graphs (Q358646) (← links)
- Metric dimension of some distance-regular graphs (Q358647) (← links)
- Maximum latency scheduling problem on two-person cooperative games (Q358650) (← links)
- An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
- On the union of intermediate nodes of shortest paths (Q358654) (← links)
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (Q358656) (← links)
- Embeddings of circulant networks (Q358657) (← links)
- On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines (Q358659) (← links)
- The maximum flow problem with disjunctive constraints (Q358660) (← links)
- Practical unicast and convergecast scheduling schemes for cognitive radio networks (Q358664) (← links)
- Parameterized complexity of \(k\)-anonymity: hardness and tractability (Q358665) (← links)
