Tomasz Radzik

2008
36	EE	Colin Cooper, Ralf Klasing, Tomasz Radzik: Locating and Repairing Faults in a Network with Mobile Agents. SIROCCO 2008: 20-32
35	EE	Sarah Steiner, Tomasz Radzik: Computing all efficient solutions of the biobjective minimum spanning tree problem. Computers & OR 35(1): 198-211 (2008)
2007
34	EE	Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang: Tree exploration with logarithmic memory. SODA 2007: 585-594
33	EE	Leszek Gasieniec, Aris Pagourtzis, Igor Potapov, Tomasz Radzik: Deterministic Communication in Radio Networks with Large Labels. Algorithmica 47(1): 97-117 (2007)
32	EE	Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco: Hardness and approximation results for Black Hole Search in arbitrary networks. Theor. Comput. Sci. 384(2-3): 201-221 (2007)
2006
31	EE	Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik: On Many-to-Many Communication in Packet Radio Networks. OPODIS 2006: 260-274
30	EE	Colin Cooper, Ralf Klasing, Tomasz Radzik: Searching for Black-Hole Faults in a Network Using Multiple Agents. OPODIS 2006: 320-332
29	EE	Susanne Albers, Tomasz Radzik: Foreword. Algorithmica 45(1): 1-2 (2006)
28	EE	Arjuna Sathiaseelan, Tomasz Radzik: Reorder notifying TCP (RN-TCP) with explicit packet drop notification (EPDN). Int. J. Communication Systems 19(6): 659-678 (2006)
2005
27	EE	Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Tomasz Radzik: On the Wake-Up Problem in Radio Networks. ICALP 2005: 347-359
26	EE	Arjuna Sathiaseelan, Tomasz Radzik: Robust TCP (TCP-R) with Explicit Packet Drop Notification (EPDN) for Satellite Networks. ICN (2) 2005: 250-257
25	EE	Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco: Approximation Bounds for Black Hole Search Problems. OPODIS 2005: 261-274
24	EE	Sarah Steiner, Tomasz Radzik: Heuristic Enhancements to the k-best Method for Solving Biobjective Combinatorial Optimisation Problems. OR 2005: 373-378
23	EE	Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco: Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. SIROCCO 2005: 200-215
2004
22		Susanne Albers, Tomasz Radzik: Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings Springer 2004
21	EE	Arjuna Sathiaseelan, Tomasz Radzik: Improving the Performance of TCP in the Case of Packet Reordering. HSNMC 2004: 63-73
20	EE	Leszek Gasieniec, Tomasz Radzik, Qin Xin: Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks. SWAT 2004: 397-407
19	EE	Tomasz Radzik: Improving time bounds on maximum generalised flow computations by contracting the network. Theor. Comput. Sci. 312(1): 75-97 (2004)
2003
18	EE	Arjuna Sathiaseelan, Tomasz Radzik: RD-TCP: Reorder Detecting TCP. HSNMC 2003: 471-480
2002
17	EE	Tomasz Radzik: Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network. ICALP 2002: 611-622
1998
16	EE	Tomasz Radzik: Implementation of Dynamic Trees with In-Subtree Operations. ACM Journal of Experimental Algorithms 3: 9 (1998)
1997
15		Tomasz Radzik: Fast deterministic approximation for the multicommodity flow problem. Math. Program. 77: 43-58 (1997)
1996
14		Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik: Shortest paths algorithms: Theory and experimental evaluation. Math. Program. 73: 129-174 (1996)
1995
13		Tomasz Radzik: Fast Deterministic Approximation for the Multicommodity Flow Problem. SODA 1995: 486-492
1994
12		Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik: Shortest Paths Algorithms: Theory and Experimental Evaluation. SODA 1994: 516-525
11		Tomasz Radzik, Andrew V. Goldberg: Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. Algorithmica 11(3): 226-242 (1994)
1993
10		Tomasz Radzik: Faster Algorithms for the Generalized Network Flow Problem FOCS 1993: 438-448
1992
9		Tomasz Radzik: Newton's Method for Fractional Combinatorial Optimization FOCS 1992: 659-669
8	EE	Tomasz Radzik: Minimizing Capacity Violations in a Transshipment Network. SODA 1992: 185-194
1991
7		Tomasz Radzik, Andrew V. Goldberg: Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. SODA 1991: 110-119
6		Marek Chrobak, Howard J. Karloff, Tomasz Radzik: Connectivity vs. Reachability Inf. Comput. 91(2): 177-188 (1991)
5		P. C. P. Bhatt, Krzysztof Diks, Torben Hagerup, V. C. Prasad, Tomasz Radzik, Sanjeev Saxena: Improved Deterministic Parallel Integer Sorting Inf. Comput. 94(1): 29-47 (1991)
1990
4	EE	Torben Hagerup, Tomasz Radzik: Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM. SPAA 1990: 117-124
1989
3		Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik: New Simulations between CRCW PRAMs. FCT 1989: 95-104
1988
2		Bogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik: Testing Isomorphism of Outerplanar Graphs in Parallel. MFCS 1988: 220-230
1		Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik: Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. MFCS 1988: 231-239

Coauthor Index

1	Susanne Albers	[22] [29]
2	P. C. P. Bhatt	[5]
3	Boris V. Cherkassky	[12] [14]
4	Bogdan S. Chlebus	[1] [2] [3] [27] [31]
5	Marek Chrobak	[6]
6	Colin Cooper	[30] [36]
7	Krzysztof Diks	[1] [2] [3] [5]
8	Leszek Gasieniec	[20] [27] [33] [34]
9	Andrew V. Goldberg	[7] [11] [12] [14]
10	Torben Hagerup	[1] [3] [4] [5]
11	Howard J. Karloff	[6]
12	Ralf Klasing	[23] [25] [30] [32] [36]
13	Dariusz R. Kowalski	[27] [31]
14	Euripides Markou	[23] [25] [32]
15	Aris Pagourtzis	[33]
16	Andrzej Pelc	[34]
17	Igor Potapov	[33]
18	V. C. Prasad	[5]
19	Fabiano Sarracco	[23] [25] [32]
20	Arjuna Sathiaseelan	[18] [21] [26] [28]
21	Sanjeev Saxena	[5]
22	Sarah Steiner	[24] [35]
23	Qin Xin	[20]
24	Xiaohui Zhang	[34]

Colors in the list of coauthors