2008 |
15 | EE | Daniel Berend,
Michael Segal,
Hanan Shpungin:
Power efficient resilience and lifetime in wireless ad-hoc networks.
FOWANC 2008: 17-24 |
14 | | Daniel Berend,
Ephraim Korach,
Shira Zucker:
Tabu search for the BWC problem.
SOFSEM (2) 2008: 22-33 |
13 | EE | Daniel Berend,
Steven Skiena,
Yochai Twitto:
Combinatorial dominance guarantees for problems with infeasible solutions.
ACM Transactions on Algorithms 5(1): (2008) |
12 | EE | Daniel Berend,
Ephraim Korach,
Vladimir Lipets:
Minimal cutwidth linear arrangements of abelian Cayley graphs.
Discrete Mathematics 308(20): 4670-4695 (2008) |
11 | EE | Daniel Berend,
Ephraim Korach,
Shira Zucker:
Anticoloring of a family of grid graphs.
Discrete Optimization 5(3): 647-662 (2008) |
2007 |
10 | EE | Daniel Berend,
Ephraim Korach,
Shira Zucker:
A Reduction of the Anticoloring Problem to Connected Graphs.
Electronic Notes in Discrete Mathematics 28: 445-451 (2007) |
2006 |
9 | EE | Daniel Berend,
Amir Sapir:
The cyclic multi-peg Tower of Hanoi.
ACM Transactions on Algorithms 2(3): 297-317 (2006) |
8 | EE | Daniel Berend,
Amir Sapir:
The diameter of Hanoi graphs.
Inf. Process. Lett. 98(2): 79-85 (2006) |
7 | EE | Dany Azriel,
Daniel Berend:
On a question of Leiss regarding the Hanoi Tower problem.
Theor. Comput. Sci. 369(1-3): 377-383 (2006) |
2005 |
6 | EE | Eitan Bachmat,
Daniel Berend,
Luba Sapir,
Steven Skiena:
Airplane Boarding, Disk Scheduling and Space-Time Geometry.
AAIM 2005: 192-202 |
5 | EE | Daniel Berend,
Amir Sapir:
Complexity of the Path Multi-Peg Tower of Hanoi.
ALENEX/ANALCO 2005: 212-217 |
2003 |
4 | EE | Daniel Berend,
Nimrod Kriger:
On some questions of Razpet regarding binomial coefficients.
Discrete Mathematics 260(1-3): 177-182 (2003) |
2002 |
3 | EE | Daniel Berend,
Luba Sapir:
Expert rule versus majority rule under partial information, II.
JAMDS 6(2): 79-99 (2002) |
1994 |
2 | | Daniel Berend,
Christiane Frougny:
Computability by Finite Automata and Pisot Bases.
Mathematical Systems Theory 27(3): 275-282 (1994) |
1987 |
1 | EE | Daniel Berend:
Parallelepipeds in sets of integers.
J. Comb. Theory, Ser. A 45(2): 163-170 (1987) |