Jeannette Janssen
List of publications from the DBLP Bibliography Server - FAQ| 2012 | ||
|---|---|---|
| j23 | Anthony Bonato, Jeannette Janssen, Pawel Pralat: Geometric Protean Graphs. Internet Mathematics 8(1-2): 2-28 (2012) | |
| j22 | Jeannette Janssen, Matt Hurshman, Nauzer Kalyaniwalla: Model Selection for Social Networks Using Graphlets. Internet Mathematics 8(4): 338-363 (2012) | |
| c21 | Anthony Bonato, Jeannette Janssen: Infinite Random Geometric Graphs from the Hexagonal Metric. IWOCA 2012: 6-19 | |
| e3 | Anthony Bonato, Jeannette C. M. Janssen (Eds.): Algorithms and Models for the Web Graph - 9th International Workshop, WAW 2012, Halifax, NS, Canada, June 22-23, 2012. Proceedings. Lecture Notes in Computer Science 7323, Springer 2012, isbn 978-3-642-30540-5 | |
| i3 | Huda Chuangpishit, Mahya Ghandehari, Matt Hurshman, Jeannette Janssen, Nauzer Kalyaniwalla: Linear embeddings of graphs and graph limits. CoRR abs/1210.4451 (2012) | |
| 2011 | ||
| i2 | Anthony Bonato, Jeannette Janssen, Pawel Pralat: Geometric protean graphs. CoRR abs/1111.0207 (2011) | |
| i1 | Jeannette Janssen, Pawel Pralat, Rory Wilson: Geometric Graph Properties of the Spatial Preferred Attachment model. CoRR abs/1111.0508 (2011) | |
| 2010 | ||
| j21 | Jeannette Janssen, Pawel Pralat: Rank-Based Attachment Leads to Power Law Graphs. SIAM J. Discrete Math. 24(2): 420-440 (2010) | |
| c20 | ||
| c19 | Anthony Bonato, Jeannette Janssen, Pawel Pralat: A geometric model for on-line social networks. MSM 2010: 4 | |
| c18 | Jeannette Janssen, Pawel Pralat, Rory Wilson: Estimating node similarity from co-citation in a spatial graph model. SAC 2010: 1329-1333 | |
| c17 | Anthony Bonato, Jeannette Janssen, Pawel Pralat: The Geometric Protean Model for On-Line Social Networks. WAW 2010: 110-121 | |
| 2009 | ||
| j20 | Anthony Bonato, Jeannette Janssen, Changping Wang: The n-ordered graphs: A new graph class. Journal of Graph Theory 60(3): 204-218 (2009) | |
| j19 | Jeannette Janssen, Pawel Pralat: Protean graphs with a variety of ranking schemes. Theor. Comput. Sci. 410(52): 5491-5504 (2009) | |
| c16 | Xiaomeng Wan, Evangelos E. Milios, Nauzer Kalyaniwalla, Jeannette Janssen: Link-based event detection in email communication networks. SAC 2009: 1506-1510 | |
| 2008 | ||
| j18 | William Aiello, Anthony Bonato, Colin Cooper, Jeannette C. M. Janssen, Pawel Pralat: A Spatial Web Graph Model with Local Influence Regions. Internet Mathematics 5(1): 175-196 (2008) | |
| c15 | Xiaomeng Wan, Evangelos E. Milios, Nauzer Kalyaniwalla, Jeannette Janssen: Link-Based Anomaly Detection in Communication Networks. Web Intelligence/IAT Workshops 2008: 402-405 | |
| e2 | William Aiello, Andrei Z. Broder, Jeannette C. M. Janssen, Evangelos E. Milios (Eds.): Algorithms and Models for the Web-Graph, Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers. Lecture Notes in Computer Science 4936, Springer 2008, isbn 978-3-540-78807-2 | |
| 2007 | ||
| j17 | Anthony Bonato, Jeannette C. M. Janssen: Infinite Limits and Adjacency Properties of a Generalized Copying Model. Internet Mathematics 4(2): 199-223 (2007) | |
| j16 | Wangzhong Lu, Jeannette C. M. Janssen, Evangelos E. Milios, Nathalie Japkowicz, Yongzheng Zhang: Node similarity in the citation graph. Knowl. Inf. Syst. 11(1): 105-129 (2007) | |
| c14 | William Aiello, Anthony Bonato, Colin Cooper, Jeannette C. M. Janssen, Pawel Pralat: A Spatial Web Graph Model with Local Influence Regions. WAW 2007: 96-107 | |
| e1 | Jeannette C. M. Janssen, Pawel Pralat (Eds.): Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers. Lecture Notes in Computer Science 4852, Springer 2007, isbn 978-3-540-77293-4 | |
| 2006 | ||
| j15 | Hongyu Liu, Jeannette C. M. Janssen, Evangelos E. Milios: Using HMM to learn user browsing patterns for focused Web crawling. Data Knowl. Eng. 59(2): 270-291 (2006) | |
| j14 | Gautam Appa, Dimitris Magos, Ioannis Mourtos, Jeannette C. M. Janssen: On the orthogonal Latin squares polytope. Discrete Mathematics 306(2): 171-187 (2006) | |
| c13 | William Aiello, Andrei Z. Broder, Jeannette Janssen, Evangelos E. Milios: Modelling and Mining of Networked Information Spaces. WAW 2006: 1-17 | |
| c12 | William Aiello, Andrei Z. Broder, Jeannette Janssen, Evangelos E. Milios: Workshop on Algorithms and Models for the Web Graph. WAW 2006: 18-23 | |
| c11 | John Healy, Jeannette Janssen, Evangelos E. Milios, William Aiello: Characterization of Graphs Using Degree Cores. WAW 2006: 137-148 | |
| 2005 | ||
| j13 | Jeannette C. M. Janssen, Tania E. Wentzell, Shannon L. Fitzpatrick: Lower Bounds from Tile Covers for the Channel Assignment Problem. SIAM J. Discrete Math. 18(4): 679-696 (2005) | |
| 2004 | ||
| j12 | Shannon L. Fitzpatrick, Jeannette Janssen, Richard J. Nowakowski: Distributive online channel assignment for hexagonal cellular networks with constraints. Discrete Applied Mathematics 143(1-3): 84-91 (2004) | |
| j11 | Sylvain Gravier, Jeannette Janssen, Kyriakos Kilakos, Sulamita Klein: Graph covers using t-colourable vertex sets. Discrete Mathematics 278(1-3): 61-80 (2004) | |
| j10 | Yuan An, Jeannette Janssen, Evangelos E. Milios: Characterizing and Mining the Citation Graph of the Computer Science Literature. Knowl. Inf. Syst. 6(6): 664-678 (2004) | |
| c10 | Anthony Bonato, Jeannette C. M. Janssen: Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces. CAAN 2004: 42-48 | |
| c9 | Hongyu Liu, Evangelos E. Milios, Jeannette Janssen: Focused Crawling by Learning HMM from User's Topic-specific Browsing. Web Intelligence 2004: 732-732 | |
| c8 | Hongyu Liu, Evangelos E. Milios, Jeannette Janssen: Probabilistic models for focused web crawling. WIDM 2004: 16-22 | |
| 2003 | ||
| j9 | Anthony Bonato, Jeannette C. M. Janssen: Infinite Limits of Copying Models of the Web Graph. Internet Mathematics 1(2): 193-213 (2003) | |
| 2002 | ||
| c7 | Jeannette Janssen, Nauzer Kalyaniwalla: Compressibility as a Measure of Local Coherence in Web Graphs. IICS 2002: 75-81 | |
| c6 | Yuan An, Jeannette Janssen, Evangelos E. Milios: Characterizing the Citation Graph as a Self-Organizing Networked Information Space. IICS 2002: 97-107 | |
| 2001 | ||
| j8 | Jeannette Janssen, Lata Narayanan: Approximation algorithms for channel assignment with constraints. Theor. Comput. Sci. 262(1): 649-667 (2001) | |
| c5 | Wangzhong Lu, Jeannette Janssen, Evangelos E. Milios, Nathalie Japkowicz: Node similarity in networked information spaces. CASCON 2001: 11 | |
| 2000 | ||
| j7 | ||
| j6 | Jeannette Janssen, Danny Krizanc, Lata Narayanan, Sunil M. Shende: Distributed Online Frequency Assignment in Cellular Networks. J. Algorithms 36(2): 119-151 (2000) | |
| c4 | Shannon L. Fitzpatrick, Jeannette Janssen, Richard J. Nowakowski: Distributive Online Channel Assignment for Hexagonal Cellular Networks with Constraints. ICALP Satellite Workshops 2000: 147-154 | |
| 1999 | ||
| j5 | Jeannette Janssen, Kyriakos Kilakos: Bounded Stable Sets: Polytopes and Colorings. SIAM J. Discrete Math. 12(2): 262-275 (1999) | |
| c3 | Jeannette Janssen, Lata Narayanan: Approximation Algorithms for Channel Assignment with Constraints. ISAAC 1999: 327-336 | |
| 1998 | ||
| c2 | Jeannette Janssen, Danny Krizanc, Lata Narayanan, Sunil M. Shende: Distributed Online Frequency Assignment in Cellular Networks. STACS 1998: 3-13 | |
| 1997 | ||
| j4 | Roland Häggkvist, Jeannette Janssen: New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs. Combinatorics, Probability & Computing 6(3): 295-313 (1997) | |
| c1 | Jeannette Janssen, Kyriakos Kilakos: An Analysis of Channel Assignment Problems Based on Tours. ICC (2) 1997: 565-569 | |
| 1996 | ||
| j3 | Roland Häggkvist, Jeannette C. M. Janssen: All-even latin squares. Discrete Mathematics 157(1-3): 199-206 (1996) | |
| 1995 | ||
| j2 | Jeannette C. M. Janssen: On Even and Odd Latin Squares. J. Comb. Theory, Ser. A 69(1): 173-181 (1995) | |
| 1990 | ||
| j1 | Patrick A. H. Bours, Jeannette C. M. Janssen, Marcel van Asperdt, Henk C. A. van Tilborg: Algebraic decoding beyond BCH of some binary cyclic codes, when e>BCH. IEEE Transactions on Information Theory 36(1): 214-222 (1990) | |
Colors in the list of coauthors
Last update Thu May 23 09:53:08 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page