Result 1 to 20 of 27 total
Multivariate complexity analysis of Swap Bribery. (English)
Algorithmica 64, No. 1, 126-151 (2012).
1
Flows in networks with delay in the vertices. (English)
Math. Nachr. 285, No. 13, 1603-1615 (2012).
2
Reaching learners beyond our hallowed halls. (English)
Commun. ACM 54, No. 5, 28-30 (2011).
3
Exploiting bounded signal flow for graph orientation based on cause-effect pairs. (English)
Marchetti-Spaccamela, Alberto (ed.) et al., Theory and practice of algorithms in (computer) systems. First international ICST conference, TAPAS 2011, Rome, Italy, April 18‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19753-6/pbk). Lecture Notes in Computer Science 6595, 104-115 (2011).
4
Agile practices in a small-scale, time-intensive web development project (English)
ITNG, 1060-1061 (2011).
5
Design and implementation of Java sniper: A community-based software code review web solution (English)
HICSS, 1-10 (2011).
6
Scriptable: supporting informal learning with cases (English)
ICER, 69-76 (2011).
7
Exploiting bounded signal flow for graph orientation based on cause-effect pairs (English)
TAPAS, 104-115 (2011).
8
Multivariate complexity analysis of swap bribery. (English)
Raman, Venkatesh (ed.) et al., Parameterized and exact computation. 5th international symposium, IPEC 2010, Chennai, India, December 13‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17492-6/pbk). Lecture Notes in Computer Science 6478, 107-122 (2010).
9
Towards a dichotomy for the possible winner problem in elections based on scoring rules. (English)
J. Comput. Syst. Sci. 76, No. 8, 812-836 (2010).
10
The semigroup approach to transport processes in networks. (English)
Physica D 239, No. 15, 1416-1421 (2010).
11
Multivariate complexity analysis of swap bribery (English)
IPEC, 107-122 (2010).
12
Discovering computing: perspectives of web designers (English)
ICER, 23-30 (2010).
13
Learning on the job: characterizing the programming knowledge and learning strategies of web designers (English)
CHI, 703-712 (2010).
14
Towards a dichotomy of finding possible winners in elections based on scoring rules. (English)
Comput. Res. Repos. 2009, Article No. 0911.3492 (2009).
15
Towards a dichotomy of finding possible winners in elections based on scoring rules. (English)
Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2009. 34th international symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24‒28, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03815-0/pbk). Lecture Notes in Computer Science 5734, 124-136 (2009).
16
Asymptotic periodicity of recurrent flows in infinite networks. (English)
Math. Z. 263, No. 1, 69-87 (2009).
17
Towards a dichotomy of finding possible winners in elections based on scoring rules (English)
MFCS, 124-136 (2009).
18
Context as support for learning computer organization. (English)
ACM J. Educ. Resour. Comput. 8, No. 3 (2008).
19
Semigroups for flows in infinite networks. (English)
Semigroup Forum 76, No. 2, 341-356 (2008).
20
Result 1 to 20 of 27 total
Start
Contact
Print
General Help
