| Publication | Date of Publication | Type |
|---|
| A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems | 2024-03-11 | Paper |
| Maximize a monotone function with a generic submodularity ratio | 2024-02-23 | Paper |
| O(n log n)-average-time algorithm for shortest network under a given topology | 2024-01-29 | Paper |
| Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity | 2024-01-25 | Paper |
| Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning | 2023-10-19 | Paper |
| A bicriteria approximation algorithm for minimum submodular cost partial multi-cover problem | 2023-10-16 | Paper |
| General rumor blocking: an efficient random algorithm with martingale approach | 2023-10-16 | Paper |
| Distance magic labeling of the halved folded \(n\)-cube | 2023-07-07 | Paper |
| Distance magic labeling of the halved folded \(n\)-cube | 2023-04-14 | Paper |
| Construction of minimum edge-fault tolerant connected dominating set in a general graph | 2023-04-14 | Paper |
| Minimum wireless charger placement with individual energy requirement | 2023-03-21 | Paper |
| A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice | 2023-01-19 | Paper |
| Nearly tight approximation algorithm for (connected) Roman dominating set | 2022-10-11 | Paper |
| Composite Community-Aware Diversified Influence Maximization with Efficient Approximation | 2022-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5097949 | 2022-09-01 | Paper |
| A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks | 2022-08-26 | Paper |
| Introduction to combinatorial optimization | 2022-08-02 | Paper |
| Parallel algorithms for maximizing one-sided $\sigma$-smooth function | 2022-06-12 | Paper |
| Nonsubmodular Optimization | 2022-06-10 | Paper |
| Friending | 2022-06-10 | Paper |
| Multi-Document Extractive Summarization as a Non-linear Combinatorial Optimization Problem | 2022-06-10 | Paper |
| Approximation algorithm for minimum partial multi-cover under a geometric setting | 2022-03-15 | Paper |
| Black-Box and Data-Driven Computation | 2021-09-30 | Paper |
| Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks | 2021-08-17 | Paper |
| Breaking thermaxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem | 2021-06-23 | Paper |
| Influence maximization problem: properties and algorithms | 2021-05-10 | Paper |
| On optimal randomized group testing with one defective item and a constrained number of positive responses | 2021-04-21 | Paper |
| Rumor correction maximization problem in social networks | 2021-03-09 | Paper |
| Data mule scheduling on a path with handling time and time span constraints | 2021-02-17 | Paper |
| Maximize a monotone function with a generic submodularity ratio | 2021-01-25 | Paper |
| Computing Minimum k-Connected m-Fold Dominating Set in General Graphs | 2020-11-09 | Paper |
| Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set | 2020-11-09 | Paper |
| Population monotonic allocation schemes for vertex cover games | 2020-10-12 | Paper |
| Optimal Coverage in Wireless Sensor Networks | 2020-09-03 | Paper |
| In Memoriam: Ker-I Ko (1950–2018) | 2020-07-20 | Paper |
| A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions | 2020-07-20 | Paper |
| Approximation algorithms for capacitated partial inverse maximum spanning tree problem | 2020-05-04 | Paper |
| A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice | 2020-04-27 | Paper |
| On the metric dimension of the folded \(n\)-cube | 2020-02-27 | Paper |
| A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem | 2019-12-27 | Paper |
| General rumor blocking: an efficient random algorithm with martingale approach | 2019-12-27 | Paper |
| Online hole healing for sensor coverage | 2019-12-03 | Paper |
| Approximation algorithm for the partial set multi-cover problem | 2019-12-03 | Paper |
| Approximation algorithms for minimum weight connected 3-path vertex cover | 2019-11-26 | Paper |
| Data-dependent approximation in social computing | 2019-11-20 | Paper |
| A class of asymptotically optimal group screening strategies with limited item participation | 2019-11-06 | Paper |
| Group testing with geometry of classical groups over finite fields | 2019-07-19 | Paper |
| Set function optimization | 2019-07-19 | Paper |
| A class of asymptotically optimal group testing strategies to identify good items | 2019-05-03 | Paper |
| On non-integer submodular set cover problem | 2018-10-22 | Paper |
| Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs | 2018-09-14 | Paper |
| Converter placement supporting broadcast in WDM optical networks | 2018-07-09 | Paper |
| Fault tolerance properties of pyramid networks | 2018-07-09 | Paper |
| Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming | 2018-05-16 | Paper |
| Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm | 2018-03-13 | Paper |
| iGreen: green scheduling for peak demand minimization | 2017-11-02 | Paper |
| Online makespan minimization in MapReduce-like systems with complex reduce tasks | 2017-05-12 | Paper |
| On positive-influence target-domination | 2017-05-12 | Paper |
| A novel approach for detecting multiple rumor sources in networks with partial observations | 2017-03-03 | Paper |
| Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs | 2016-10-27 | Paper |
| Algorithms for the partial inverse matroid problem in which weights can only be increased | 2016-09-15 | Paper |
| Sensor Cover and Double Partition | 2016-09-13 | Paper |
| A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs | 2016-05-25 | Paper |
| Influence Diffusion in Social Networks | 2015-10-05 | Paper |
| A new strongly competitive group testing algorithm with small sequentiality | 2015-08-21 | Paper |
| A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph | 2015-03-30 | Paper |
| A Zig-Zag Approach for Competitive Group Testing | 2015-01-26 | Paper |
| A formal proof of the deadline driven scheduler in PPTL axiomatic system | 2014-10-06 | Paper |
| New approximations for Maximum Lifetime Coverage | 2014-07-10 | Paper |
| Minimum vertex cover in ball graphs through local search | 2014-07-04 | Paper |
| Routing-efficient CDS construction in disk-containment graphs | 2014-04-30 | Paper |
| Theory of Computational Complexity | 2014-03-04 | Paper |
| Complexity and approximation of the connected set-cover problem | 2012-09-27 | Paper |
| Connected dominating set. Theory and applications | 2012-07-30 | Paper |
| Radar placement along banks of river | 2012-06-13 | Paper |
| Design and analysis of approximation algorithms | 2011-11-22 | Paper |
| On minimum submodular cover with submodular cost | 2011-06-03 | Paper |
| New dominating sets in social networks | 2010-11-12 | Paper |
| Wireless networking, dominating and packing | 2010-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579442 | 2010-08-06 | Paper |
| Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable | 2010-04-28 | Paper |
| Greedy approximations for minimum submodular cover with submodular cost | 2010-03-19 | Paper |
| A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks | 2009-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5324208 | 2009-08-03 | Paper |
| On the upper bounds of the minimum number of rows of disjunct matrices | 2009-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3514991 | 2008-07-24 | Paper |
| Double Partition: (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs | 2008-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5457049 | 2008-04-14 | Paper |
| An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution | 2008-02-18 | Paper |
| Reliabilities of Consecutive-2 Graphs | 2007-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5395177 | 2006-11-01 | Paper |
| Optimal relay location for resource-limited energy-efficient wireless communication | 2006-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692514 | 2005-09-28 | Paper |
| Optimal Rectangular Partitions | 2005-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736227 | 2004-08-09 | Paper |
| A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks | 2004-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4435201 | 2003-11-27 | Paper |
| Placement of Web-Server Proxies with Consideration of Read and Update Operations on the Internet | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4429164 | 2003-09-24 | Paper |
| On a minimum linear classification problem | 2003-08-21 | Paper |
| Lower bounds on the minus domination and \(k\)-subdomination numbers. | 2003-08-17 | Paper |
| Paired-domination of trees | 2003-06-09 | Paper |
| An extension of DHH-Erdős conjecture on cycle-plus-triangle graphs | 2003-04-02 | Paper |
| New bounds on a hypercube coloring problem. | 2003-01-21 | Paper |
| Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1 | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4786436 | 2002-12-16 | Paper |
| On connectivity of consecutive-\(d\) digraphs | 2002-12-02 | Paper |
| Optimization of wavelength assignment for QoS multicast in WDM networks | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551377 | 2002-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551389 | 2002-09-05 | Paper |
| Rivest-Vuillemin conjecture is true for monotone Boolean functions with twelve variables | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4550356 | 2002-08-21 | Paper |
| Placement of data replicas for optimal data availability in ring networks | 2002-07-31 | Paper |
| New constructions of non-adaptive and error-tolerance pooling designs | 2002-07-14 | Paper |
| Approximations for a bottleneck Steiner tree problem | 2002-05-21 | Paper |
| Approximations for Steiner trees with minimum number of Steiner points | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2751859 | 2002-02-27 | Paper |
| Optimal Placement of Web Proxies for Replicated Web Servers in the Internet | 2002-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234114 | 2002-02-03 | Paper |
| Monotone routing in multirate rearrangeable Clos networks | 2002-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2751928 | 2001-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2743985 | 2001-09-18 | Paper |
| Mathematical theory of optimization | 2001-08-26 | Paper |
| Multirate multicast switching networks | 2001-08-20 | Paper |
| Approximations for Steiner trees with minimum number of Steiner points | 2001-03-20 | Paper |
| Optimal consecutive-\(k\)-out-of-(\(2k+1\)): \(G\) cycle | 2001-02-18 | Paper |
| Grade of service Steiner minimum trees in the Euclidean plane | 2001-01-01 | Paper |
| A coloring problem on the \(n\)-cube | 2000-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4515737 | 2000-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4515746 | 2000-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4506360 | 2000-09-17 | Paper |
| The Rivest-Vuillemin conjecture on monotone Boolean functions is true for ten variables | 2000-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250425 | 2000-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942157 | 2000-03-20 | Paper |
| Line digraph iterations and diameter vulnerability | 2000-02-15 | Paper |
| On Rearrangeability of Multirate Clos Networks | 1999-10-28 | Paper |
| An \(O(n\log n)\) average time algorithm for computing the shortest network under a given topology | 1999-08-08 | Paper |
| Interconnecting Highways | 1999-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218424 | 1999-03-22 | Paper |
| Thek-Steiner Ratio in the Rectilinear Plane | 1999-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217694 | 1999-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400643 | 1999-02-10 | Paper |
| In memoriam Ronald V. Book (1937--1997) | 1999-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4362978 | 1998-11-01 | Paper |
| On 1-rate wide-sense nonblocking for 3-stage Clos networks | 1998-06-09 | Paper |
| The Steiner ratio for the dual normed plane | 1998-06-01 | Paper |
| Super line-connectivity of consecutive-\(d\) digraphs | 1998-05-04 | Paper |
| A special case for subset interconnection designs | 1998-01-26 | Paper |
| A test problem generator for the Steiner problem in graphs | 1998-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4363167 | 1997-12-18 | Paper |
| A \((\log_ 2 3+{1\over 2})\)-competitive algorithm for the counterfeit coin problem | 1997-10-09 | Paper |
| Thek-Steiner Ratio in Graphs | 1997-05-26 | Paper |
| On the diameter vulnerability of Kautz digraphs | 1996-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4894397 | 1996-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4883383 | 1996-10-13 | Paper |
| Disproofs of generalized Gilbert-Pollak conjecture on the Steiner ratio in three or more dimensions | 1996-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4859013 | 1996-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4870158 | 1996-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840101 | 1996-01-22 | Paper |
| Convergence properties of optimization algorithms for the SAT problem | 1996-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4857782 | 1995-12-06 | Paper |
| A tight lower bound for the Steiner ratio in Minkowski planes | 1995-08-27 | Paper |
| On component-size bounded Steiner trees | 1995-07-24 | Paper |
| On greedy heuristic for Steiner minimum trees | 1995-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4833808 | 1995-05-23 | Paper |
| On complexity of subset interconnection designs | 1995-05-15 | Paper |
| A continuous version of a result of Du and Hwang | 1995-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4323605 | 1995-02-23 | Paper |
| The Hamiltonian property of consecutive-\(d\) digraphs | 1994-06-12 | Paper |
| Minimal‐distance routing for KYKLOS II | 1994-03-24 | Paper |
| Competitive group testing | 1994-03-21 | Paper |
| On better heuristics for Steiner minimum trees | 1993-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694729 | 1993-06-29 | Paper |
| Minimum Steiner trees in normed planes | 1993-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035323 | 1993-05-18 | Paper |
| A note on shortest superstrings with flipping | 1993-05-16 | Paper |
| Reducing the Steiner Problem in a Normed Space | 1993-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4023988 | 1993-01-23 | Paper |
| A note of best fractions of a computable real number | 1993-01-17 | Paper |
| Connectivity of consecutive-\(d\) digraphs | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4016115 | 1992-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010313 | 1992-09-27 | Paper |
| Steiner Minimal Trees on Chinese Checkerboards | 1992-09-27 | Paper |
| A proof of the Gilbert-Pollak conjecture on the Steiner ratio | 1992-06-28 | Paper |
| On Steiner minimal trees with \(L_ p\) distance | 1992-06-28 | Paper |
| On Steiner ratio conjectures | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3983503 | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3984071 | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3984073 | 1992-06-27 | Paper |
| Partitionable starters for twin prime power type | 1991-01-01 | Paper |
| On heuristics for minimum length rectilinear partitions | 1990-01-01 | Paper |
| Diameter and radius in the Manhattan metric | 1990-01-01 | Paper |
| The complexity of determinacy problem on group testing | 1990-01-01 | Paper |
| On Rosen's gradient projection methods | 1990-01-01 | Paper |
| Optimal Assembly of an s-Stage k-Out-of-n System | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3348697 | 1990-01-01 | Paper |
| A combinatorial problem related to distributed loop networks | 1990-01-01 | Paper |
| The Steiner ratio conjecture of Gilbert and Pollak is true. | 1990-01-01 | Paper |
| On the complexity of an optimal routing tree problem | 1989-01-01 | Paper |
| On inefficient special cases of NP-complete problems | 1989-01-01 | Paper |
| Global convergence of Rosen's gradient projection method | 1989-01-01 | Paper |
| Lower bounds for weak Byzantine agreement | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3348420 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3351160 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3353038 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4205392 | 1989-01-01 | Paper |
| A decomposition theorem on Euclidean Steiner minimal trees | 1988-01-01 | Paper |
| The structure of generalized complexity cores | 1988-01-01 | Paper |
| Notes on polynomial levelability | 1988-01-01 | Paper |
| A direct algorithm for computing reliability of a consecutive-k cycle | 1988-01-01 | Paper |
| Generalized de Bruijn digraphs | 1988-01-01 | Paper |
| Matroids and Subset Interconnection Design | 1988-01-01 | Paper |
| Existence of Symmetric Skew Balanced Starters for Odd Prime Powers | 1988-01-01 | Paper |
| Remarks on the convergence of Rosen's gradient projection method | 1987-01-01 | Paper |
| Steiner minimal trees for bar waves | 1987-01-01 | Paper |
| Steiner minimal trees on sets of four points | 1987-01-01 | Paper |
| Optimal Assignments for Consecutive-2 Graphs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789316 | 1987-01-01 | Paper |
| Some Completeness Results on Decision Trees and Group Testing | 1987-01-01 | Paper |
| An optimization problem on graphs | 1986-01-01 | Paper |
| On one-way functions and polynomial-time isomorphisms | 1986-01-01 | Paper |
| A convergence theorem of Rosen’s gradient projection method | 1986-01-01 | Paper |
| Optimal Consecutive-2-Out-of-n Systems | 1986-01-01 | Paper |
| On a conjecture of trietsch and handler on the flow-dependent steiner ratio | 1986-01-01 | Paper |
| A family of gradient projection methods | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680625 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3691590 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3695020 | 1985-01-01 | Paper |
| Steiner Minimal Tree for Points on a Circle | 1985-01-01 | Paper |
| Optimal consecutive-2 systems of lines and cycles | 1985-01-01 | Paper |
| A superlinearly convergent method to linearly constrained optimization problems under degeneracy | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3325491 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3039052 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3318547 | 1983-01-01 | Paper |
| A New Bound for the Steiner Ratio | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3661322 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3663561 | 1982-01-01 | Paper |
| Comparisons on Blocking Probabilities for Regular Series Parallel Channel Graphs | 1982-01-01 | Paper |
| Balanced Howell Rotations of the Twin prime Power Type | 1982-01-01 | Paper |
| Minimizing a Combinatorial Function | 1982-01-01 | Paper |
| Symmetric Skew Balanced Starters and Complete Balanced Howell Rotations | 1982-01-01 | Paper |
| Characterization for Series-Parallel Channel Graphs | 1981-01-01 | Paper |
| Hypergeometric and Generalized Hypergeometric Group Testing | 1981-01-01 | Paper |
