Demo Data from SIGIR 2026 / reviewers in the wild / expert
Tonguç Ünlüyurt
dblp:26/2397
· DBLP profile ↗
9ranked-venue papers
2as first author
1since 2021 · last 2025
0000-0002-3840-0806ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 2 first-author · 1 since 2021Computer networks · 2Software engineering, systems software and programming languages · 2Artificial intelligence and machine learning · 1Human-computer interaction and ubiquitous computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer networks
1 paper |
Wireless networking · 44% Internet of things and sensor networks · 22% Network optimization and economics · 22% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Wireless networking › broadcast
energy-efficient broadcast |
0.1 | 1 | 2009 | Hop Constrained Energy-Efficient Broadcasting: Insights from Massively Dense Ad Hoc Networks · IEEE Trans. Mob. Comput. 2009 |
Wireless networking
mobile ad hoc networks |
0.1 | 1 | 2009 | Hop Constrained Energy-Efficient Broadcasting: Insights from Massively Dense Ad Hoc Networks · IEEE Trans. Mob. Comput. 2009 |
Network optimization and economics
resource allocation |
0.1 | 1 | 2009 | Hop Constrained Energy-Efficient Broadcasting: Insights from Massively Dense Ad Hoc Networks · IEEE Trans. Mob. Comput. 2009 |
Internet of things and sensor networks
wireless sensor network |
0.1 | 1 | 2009 | Hop Constrained Energy-Efficient Broadcasting: Insights from Massively Dense Ad Hoc Networks · IEEE Trans. Mob. Comput. 2009 |
Routing and switching › routing
broadcast routing |
0.0 | 1 | 2009 | Hop Constrained Energy-Efficient Broadcasting: Insights from Massively Dense Ad Hoc Networks · IEEE Trans. Mob. Comput. 2009 |
Routing and switching
broadcast tree construction |
0.0 | 1 | 2009 | Hop Constrained Energy-Efficient Broadcasting: Insights from Massively Dense Ad Hoc Networks · IEEE Trans. Mob. Comput. 2009 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.1optimization-based algorithm · 0.1dynamic programming · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Sequential testing problem: A follow-up review
Tonguç Ünlüyurt |
Discret. Appl. Math. | 1 |
| 2019 | Power allocation and routing for full-duplex multi hop wireless networks under full interference
Kudret Akcapinar, Özgür Gürbüz, Tonguç Ünlüyurt |
Ad Hoc Networks | 3 |
| 2017 | Evaluation of Monotone DNF Formulas
Sarah R. Allen, Lisa Hellerstein, Devorah Kletenik, Tonguç Ünlüyurt |
Algorithmica | 4 |
| 2016 | Effective algorithms for constructing minimum cost adaptive distinguishing sequences
Uraz Cengiz Türker, Tonguç Ünlüyurt, Hüsnü Yenigün |
Inf. Softw. Technol. | 2 |
| 2014 | Lookahead-Based Approaches for Minimizing Adaptive Distinguishing Sequences
Uraz Cengiz Türker, Tonguç Ünlüyurt, Hüsnü Yenigün |
ICTSS | 2 |
| 2011 | TestAnt: An ant colony system approach to sequential testing under precedence constraints
Bülent Çatay, Özgür Özlük, Tonguç Ünlüyurt |
Expert Syst. Appl. | 3 |
| 2009 | Hop Constrained Energy-Efficient Broadcasting: Insights from Massively Dense Ad Hoc NetworksabstractWe consider source-initiated broadcast session traffic in an ad hoc wireless network operating under a hard constraint on the end-to-end delay between the source and any node in the network. We measure the delay to a given node in the number of hops data travels from the source to that node, and our objective in this paper is to construct an energy-efficient broadcast tree that has a maximum depth Δ, where Δ; represents the end-to-end hop constraint in the network. We characterize the optimal solution to a closely related problem in massively dense networks using a dynamic programming formulation. We prove that the optimal solution can be obtained by an algorithm of polynomial time complexity O(Δ²). The solution to the dynamic program indicates that there is a single optimal policy applicable to all massively dense networks. Elaborating on the insights provided by the structure of the problem in massively dense networks, we design an algorithm for finding a solution to the hop constrained minimum power broadcasting problem in general networks. By extensive simulations, we demonstrate that our proposed optimization-based algorithm generates broadcast trees within 20% of optimality for general dense networks. Kerem Bülbül, Özgür Erçetin, Tonguç Ünlüyurt |
IEEE Trans. Mob. Comput. | 3 |
| 2007 | Bottom-Up Construction of Minimum-Cost and/or Trees for Sequential Fault DiagnosisabstractThe problem of generating the sequence of tests required to reach a diagnostic conclusion with minimum average cost, which is also known as a test-sequencing problem, is considered. The traditional test-sequencing problem is generalized here to include asymmetrical tests. In general, the next test to execute depends on the results of previous tests. Hence, the test-sequencing problem can naturally be formulated as an optimal binary AND/OR decision tree construction problem, whose solution is known to be NP-hard. Our approach is based on integrating concepts from one-step look-ahead heuristic algorithms and basic ideas of Huffman coding to construct an AND/OR decision tree bottom-up as opposed to heuristics proposed in the literature that construct the AND/OR trees top-down. The performance of the algorithm is demonstrated on numerous test cases, with various properties. O. Erhun Kundakcioglu, Tonguç Ünlüyurt |
IEEE Trans. Syst. Man Cybern. Part A | 2 |
| 2004 | Sequential testing of complex systems: a review
Tonguç Ünlüyurt |
Discret. Appl. Math. | 1 |