Khaled M. Elbassioni

	2012
100		Stefan Canzar, Mohammed El-Kebir, René Pool, Khaled M. Elbassioni, Alpeshkumar K. Malde, Alan E. Mark, Daan P. Geerke, Leen Stougie, Gunnar W. Klau: Charge Group Partitioning in Biomolecular Simulation. RECOMB 2012: 29-43
99		Katarzyna E. Paluch, Khaled M. Elbassioni, Anke van Zuylen: Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem. STACS 2012: 501-506
98		Parinya Chalermsook, Khaled M. Elbassioni, Danupon Nanongkai, He Sun: Multi-Attribute Profit-Maximizing Pricing (Extended Abstract) CoRR abs/1202.2840: (2012)
97		Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray: Conflict-Free Coloring for Rectangle Ranges Using O(n .382) Colors. Discrete & Computational Geometry 48(1): 39-52 (2012)
96		Khaled M. Elbassioni, Hans Raj Tiwary: Complexity of approximating the vertex centroid of a polyhedron. Theor. Comput. Sci. 421: 56-61 (2012)
	2011
95		Khaled M. Elbassioni, Imran Rauf, Saurabh Ray: Enumerating Minimal Transversals of Geometric Hypergraphs. CCCG 2011
94		Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey: Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes. ICALP (1) 2011: 147-158
93		Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Klau, Julián Mestre: On Tree-Constrained Matchings and Generalizations. ICALP (1) 2011: 98-109
92		Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, Domagoj Severdija: Improved Approximations for Guarding 1.5-Dimensional Terrains. Algorithmica 60(2): 451-463 (2011)
91		Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre: Approximation Algorithms for the Interval Constrained Coloring Problem. Algorithmica 61(2): 342-361 (2011)
90		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary: The negative cycles polyhedron and hardness of checking some polyhedral properties. Annals OR 188(1): 63-76 (2011)
89		Khaled M. Elbassioni, Hans Raj Tiwary: On a cone covering problem. Comput. Geom. 44(3): 129-134 (2011)
88		T.-H. Hubert Chan, Khaled M. Elbassioni: A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics. Discrete & Computational Geometry 46(4): 704-723 (2011)
87		Khaled M. Elbassioni, Amr Elmasry, Kazuhisa Makino: Finding Simplices containing the Origin in Two and Three Dimensions. Int. J. Comput. Geometry Appl. 21(5): 495-506 (2011)
86		Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf: On the readability of monotone Boolean formulae. J. Comb. Optim. 22(3): 293-304 (2011)
	2010
85		Stefan Canzar, Khaled M. Elbassioni, Julián Mestre: A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem. ALENEX 2010: 23-33
84		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. IPCO 2010: 341-354
83		Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman: On the Approximability of the Maximum Interval Constrained Coloring Problem. ISAAC (2) 2010: 168-179
82		T.-H. Hubert Chan, Khaled M. Elbassioni: A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics. SODA 2010: 256-267
81		George Christodoulou, Khaled M. Elbassioni, Mahmoud Fouz: Truthful Mechanisms for Exhibitions. WINE 2010: 170-181
80		Khaled M. Elbassioni, Mahmoud Fouz, Chaitanya Swamy: Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply. WINE 2010: 462-472
79		Khaled M. Elbassioni, Imran Rauf: Polynomial-time dualization of r-exact hypergraphs with applications in geometry. Discrete Mathematics 310(17-18): 2356-2363 (2010)
78		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: On effectivity functions of game forms. Games and Economic Behavior 68(2): 512-531 (2010)
77		Endre Boros, Khaled M. Elbassioni, Kazuhisa Makino: Left-to-Right Multiplication for Monotone Boolean Dualization. SIAM J. Comput. 39(7): 3424-3439 (2010)
	2009
76		Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf: On the Readability of Monotone Boolean Formulae. COCOON 2009: 496-505
75		Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf: Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs. ESA 2009: 143-154
74		Khaled M. Elbassioni, Hans Raj Tiwary: Complexity of Approximating the Vertex Centroid of a Polyhedron. ISAAC 2009: 413-422
73		Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters: On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. SAGT 2009: 275-286
72		Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters: On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. SODA 2009: 1210-1219
71		Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, Domagoj Severdija: Improved Approximations for Guarding 1.5-Dimensional Terrains. STACS 2009: 361-371
70		Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray: On Profit-Maximizing Pricing for the Highway and Tollbooth Problems CoRR abs/0901.1140: (2009)
69		Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters: Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods. Int. J. Comput. Geometry Appl. 19(2): 173-193 (2009)
68		Khaled M. Elbassioni: Algorithms for Dualization over Products of Partially Ordered Sets. SIAM J. Discrete Math. 23(1): 487-510 (2009)
	2008
67		Khaled M. Elbassioni, Hans Raj Tiwary: On a Cone Covering Problem. CCCG 2008
66		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov: A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames. CSR 2008: 99-109
65		Endre Boros, Khaled M. Elbassioni, Kazuhisa Makino: On Berge Multiplication for Monotone Boolean Dualization. ICALP (1) 2008: 48-59
64		Khaled M. Elbassioni, Matthias Hagen, Imran Rauf: Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems. IWPEC 2008: 91-102
63		Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre: Approximating the Interval Constrained Coloring Problem. SWAT 2008: 210-221
62		Hans Raj Tiwary, Khaled M. Elbassioni: On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism. Symposium on Computational Geometry 2008: 192-198
61		Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel: Indexing Schemes for Multi-dimensional Moving Objects. Encyclopedia of GIS 2008: 523-529
60		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: On Enumerating Minimal Dicuts and Strongly Connected Subgraphs. Algorithmica 50(1): 159-172 (2008)
59		Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Generating Cut Conjunctions in Graphs and Related Problems. Algorithmica 51(3): 239-263 (2008)
58		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary: Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra CoRR abs/0801.3790: (2008)
57		Khaled M. Elbassioni, Hans Raj Tiwary: On Computing the Vertex Centroid of a Polyhedron CoRR abs/0806.3456: (2008)
56		Khaled M. Elbassioni, Domagoj Matijevic, Julián Mestre, Domagoj Severdija: Improved Approximations for Guarding 1.5-Dimensional Terrains CoRR abs/0809.0159: (2008)
55		Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich: Generating All Vertices of a Polyhedron Is Hard. Discrete & Computational Geometry 39(1-3): 174-190 (2008)
54		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions. Discrete Applied Mathematics 156(11): 2020-2034 (2008)
53		Khaled M. Elbassioni: On the complexity of monotone dualization and generating minimal hypergraph transversals. Discrete Applied Mathematics 156(11): 2109-2123 (2008)
52		Khaled M. Elbassioni: A note on systems with max-min and max-product constraints. Fuzzy Sets and Systems 159(17): 2272-2277 (2008)
51		Martin Kutz, Khaled M. Elbassioni, Irit Katriel, Meena Mahajan: Simultaneous matchings: Hardness and approximation. J. Comput. Syst. Sci. 74(5): 884-897 (2008)
50		Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Gábor Rudolf, Jihui Zhao: On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction. Theory Comput. Syst. 43(2): 204-233 (2008)
	2007
49		Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf: Generating Minimal k-Vertex Connected Spanning Subgraphs. COCOON 2007: 222-231
48		Khaled M. Elbassioni, René Sitters, Yan Zhang: A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs. ESA 2007: 451-462
47		Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray: Conflict-free coloring for rectangle ranges using O(n.382) colors. SPAA 2007: 181-187
46		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. Discrete Applied Mathematics 155(2): 137-149 (2007)
45		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: A global parallel algorithm for the hypergraph transversal problem. Inf. Process. Lett. 101(4): 148-155 (2007)
44		Leonid Khachiyan, Endre Boros, Vladimir Gurvich, Khaled M. Elbassioni: Computing Many Maximal Independent Sets for Hypergraphs in Parallel. Parallel Processing Letters 17(2): 141-152 (2007)
43		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data. Theor. Comput. Sci. 379(3): 361-376 (2007)
42		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs. Theor. Comput. Sci. 382(2): 139-150 (2007)
	2006
41		Khaled M. Elbassioni: On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization. ESA 2006: 340-351
40		Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Enumerating Spanning and Connected Subsets in Graphs and Matroids. ESA 2006: 444-455
39		Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters: On Approximating the TSP with Intersecting Neighborhoods. ISAAC 2006: 213-222
38		Khaled M. Elbassioni: Finding All Minimal Infrequent Multi-dimensional Intervals. LATIN 2006: 423-434
37		Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich: Generating all vertices of a polyhedron is hard. SODA 2006: 758-765
36		Khaled M. Elbassioni, Nabil H. Mustafa: Conflict-Free Colorings of Rectangles Ranges. STACS 2006: 254-263
35		Khaled M. Elbassioni, Irit Katriel: Multiconsistency and Robustness with Global Constraints. Constraints 11(4): 335-352 (2006)
34		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation. Discrete Applied Mathematics 154(16): 2350-2372 (2006)
33		Khaled M. Elbassioni, Zvi Lotker, Raimund Seidel: Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices. Inf. Process. Lett. 100(2): 69-71 (2006)
32		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms. Journal of Graph Theory 53(3): 209-232 (2006)
	2005
31		Amr Elmasry, Khaled M. Elbassioni: Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in the Plane. CCCG 2005: 248-251
30		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: A New Algorithm for the Hypergraph Transversal Problem. COCOON 2005: 767-776
29		Khaled M. Elbassioni, Irit Katriel: Multiconsistency and Robustness with Global Constraints. CPAIOR 2005: 168-182
28		Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters: Approximation Algorithms for Euclidean Group TSP. ICALP 2005: 1115-1126
27		Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan: Simultaneous Matchings. ISAAC 2005: 106-115
26		Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. ISAAC 2005: 156-165
25		Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid Inequalities. MFCS 2005: 556-567
24		Khaled M. Elbassioni, Zvi Lotker, Raimund Seidel: Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices CoRR abs/cs/0507038: (2005)
23		Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel: An Indexing Method for Answering Queries on Moving Objects. Distributed and Parallel Databases 17(3): 215-249 (2005)
22		Leonid G. Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: On the Complexity of Some Enumeration Problems for Matroids. SIAM J. Discrete Math. 19(4): 966-984 (2005)
	2004
21		Khaled M. Elbassioni, Amr Elmasry, Vladimir Gurvich: A stronger version of Bárány's theorem in the plane. CCCG 2004: 4-6
20		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems. ESA 2004: 122-133
19		Mohamed F. Mokbel, Walid G. Aref, Khaled M. Elbassioni, Ibrahim Kamel: Scalable Multimedia Disk Scheduling. ICDE 2004: 498-509
18		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. IPCO 2004: 152-162
17		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. LATIN 2004: 488-498
16		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: Generating Paths and Cuts in Multi-pole (Di)graphs. MFCS 2004: 298-309
15		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An Efficient Implementation of a Joint Generation Algorithm. WEA 2004: 114-128
	2003
14		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals. ESA 2003: 556-567
13		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: An Intersection Inequality for Discrete Distributions and Related Generation Problems. ICALP 2003: 543-555
12		Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel: An Efficient Indexing Scheme for Multi-dimensional Moving Objects. ICDT 2003: 422-436
11		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Algorithms for Enumerating Circuits in Matroids. ISAAC 2003: 485-494
10		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An inequality for polymatroid functions and its applications. Discrete Applied Mathematics 131(2): 255-281 (2003)
9		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices. Math. Program. 98(1-3): 355-368 (2003)
	2002
8		Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel: Efficient answering of polyhedral queries in rd using bbs-trees. CCCG 2002: 54-57
7		Khaled M. Elbassioni: An Algorithm for Dualization in Products of Lattices and Its Applications. ESA 2002: 424-435
6		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Matroid Intersections, Polymatroid Inequalities, and Related Problems. MFCS 2002: 143-154
5		Khaled M. Elbassioni: On Dualization in Products of Forests. STACS 2002: 142-153
4		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities. SIAM J. Comput. 31(5): 1624-1643 (2002)
	2001
3		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities. ICALP 2001: 92-103
2		Mahfuzur Rahman, Khaled M. Elbassioni, Ibrahim Kamel: Handling Large Real-Time Disk Access Requests With Variable Priorities. ICME 2001
	2000
1		Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension. Parallel Processing Letters 10(4): 253-266 (2000)

Coauthor Index

1	Deepak Ajwani	[47] [97]
2	Ernst Althaus	[63] [91]
3	Walid G. Aref	[19]
4	Endre Boros	[1] [3] [4] [6] [9] [10] [11] [13] [14] [15] [16] [17] [18] [20] [22] [25] [26] [30] [32] [34] [37] [40] [42] [43] [44] [45] [46] [49] [50] [54] [55] [58] [59] [60] [65] [66] [77] [78] [84] [90] [94]
5	Konrad Borys	[26] [37] [40] [49] [50] [55] [59]
6	Stefan Canzar	[63] [83] [85] [91] [93] [100]
7	Parinya Chalermsook	[98]
8	T.-H. Hubert Chan (Hubert T.-H. Chan)	[82] [88]
9	George Christodoulou	[81]
10	Mohammed El-Kebir	[100]
11	Amr Elmasry	[8] [12] [21] [23] [31] [61] [83] [87]
12	Aleksei V. Fishkin	[28] [39] [69]
13	Mahmoud Fouz	[80] [81] [94]
14	Daan P. Geerke	[100]
15	Sathish Govindarajan	[47] [97]
16	Vladimir Gurvich	[1] [3] [4] [6] [9] [10] [11] [13] [14] [15] [16] [17] [18] [20] [21] [22] [25] [26] [30] [32] [34] [37] [40] [42] [43] [44] [45] [46] [49] [50] [54] [55] [58] [59] [60] [66] [78] [84] [90] [94]
17	Matthias Hagen	[64]
18	Ibrahim Kamel	[2] [8] [12] [19] [23] [61]
19	Andreas Karrenbauer	[63] [91]
20	Irit Katriel	[27] [29] [35] [51]
21	Leonid Khachiyan (Leonid G. Khachiyan)	[1] [3] [4] [6] [9] [10] [11] [13] [14] [15] [16] [17] [18] [22] [25] [26] [30] [34] [37] [40] [42] [43] [44] [45] [46] [50] [54] [55] [59] [60]
22	Gunnar W. Klau	[93] [100]
23	Erik Krohn	[71] [92]
24	Martin Kutz	[27] [51]
25	Zvi Lotker	[24] [33]
26	Meena Mahajan	[27] [51]
27	Kazuhisa Makino	[3] [4] [13] [16] [22] [26] [40] [43] [46] [49] [59] [65] [66] [75] [76] [77] [78] [84] [86] [87] [94]
28	Alpeshkumar K. Malde	[100]
29	Bodo Manthey (Bodo Siebert)	[94]
30	Alan E. Mark	[100]
31	Domagoj Matijevic	[56] [71] [92]
32	Julián Mestre	[56] [63] [71] [85] [91] [92] [93]
33	Mohamed F. Mokbel	[19]
34	Nabil H. Mustafa	[28] [36]
35	Danupon Nanongkai	[98]
36	Vladimir Oudalov	[66]
37	Katarzyna E. Paluch	[99]
38	René Pool	[100]
39	Mahfuzur Rahman	[2]
40	Rajiv Raman	[70] [72] [73] [83]
41	Imran Rauf	[64] [75] [76] [79] [86] [95]
42	Saurabh Ray	[47] [70] [72] [73] [95] [97]
43	Gábor Rudolf	[49] [50]
44	Raimund Seidel	[24] [33]
45	Domagoj Severdija	[56] [71] [92]
46	René Sitters (René A. Sitters)	[28] [39] [48] [69] [72] [73]
47	Leen Stougie	[100]
48	He Sun	[98]
49	Chaitanya Swamy	[80]
50	Hans Raj Tiwary	[57] [58] [62] [67] [74] [89] [90] [96]
51	Yan Zhang	[48]
52	Jihui Zhao	[50]
53	Anke van Zuylen	[99]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page