The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Johannes A. La Poutré: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Johannes A. La Poutré, Jan van Leeuwen
    Maintenance of Transitive Closures and Transitive Reductions of Graphs. [Citation Graph (1, 0)][DBLP]
    WG, 1987, pp:106-120 [Conf]
  2. Enrico Gerding, D. J. A. Somefun, Johannes A. La Poutré
    Automated bilateral bargaining about multiple attributes in a one-to-many setting. [Citation Graph (0, 0)][DBLP]
    ICEC, 2004, pp:105-112 [Conf]
  3. D. J. A. Somefun, Tomas B. Klos, Johannes A. La Poutré
    Online learning of aggregate knowledge about non-linear preferences applied to negotiating prices and bundles. [Citation Graph (0, 0)][DBLP]
    ICEC, 2004, pp:361-370 [Conf]
  4. Pieter Jan't Hoen, Sander M. Bohte, Enrico Gerding, Johannes A. La Poutré
    An Extensible Agent Architecture for a Competitive Market-Based Allocation of Consumer Attention Space. [Citation Graph (0, 0)][DBLP]
    AMEC, 2002, pp:273-288 [Conf]
  5. Pieter Jan't Hoen, Johannes A. La Poutré
    A Decommitment Strategy in a Competitive Multi-agent Transportation Setting. [Citation Graph (0, 0)][DBLP]
    AMEC, 2003, pp:56-72 [Conf]
  6. D. J. A. Somefun, Enrico Gerding, Sander M. Bohte, Johannes A. La Poutré
    Automated Negotiation and Bundling of Information Goods. [Citation Graph (0, 0)][DBLP]
    AMEC, 2003, pp:1-17 [Conf]
  7. Rob van Stee, Johannes A. La Poutré
    Partial servicing of on-line jobs. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:250-261 [Conf]
  8. Enrico Gerding, Koye Somefun, Johannes A. La Poutré
    Bilateral Bargaining in a One-to-Many Bargaining Settin. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2004, pp:1438-1439 [Conf]
  9. Pieter Jan't Hoen, Sander M. Bohte, Johannes A. La Poutré
    Learning from induced changes in opponent (re)actions in multi-agent games. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2006, pp:728-735 [Conf]
  10. Pieter Jan't Hoen, Johannes A. La Poutré
    A decommitment strategy in a competitive multi-agent transportation setting. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2003, pp:1010-1011 [Conf]
  11. Pieter Jan't Hoen, Girish Redekar, Valentin Robu, Johannes A. La Poutré
    Simulation and Visualization of a Market-Based Model for Logistics Management in Transportation. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2004, pp:1218-1219 [Conf]
  12. Valentin Robu, D. J. A. Somefun, Johannes A. La Poutré
    Modeling complex multi-issue negotiations using utility graphs. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2005, pp:280-287 [Conf]
  13. D. J. A. Somefun, Johannes A. La Poutré
    A scalable method for online learning of non-linear preferences based on anonymous negotiation data. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2006, pp:417-419 [Conf]
  14. Pieter Jan't Hoen, Johannes A. La Poutré
    Repeated Auctions with Complementarities: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    BNAIC, 2005, pp:313-314 [Conf]
  15. D. J. A. Somefun, Tomas B. Klos, Johannes A. La Poutré
    Negotiating over Bundles and Prices Using Aggregate Knowledge. [Citation Graph (0, 0)][DBLP]
    EC-Web, 2004, pp:218-227 [Conf]
  16. Monika Rauch Henzinger, Johannes A. La Poutré
    Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:171-184 [Conf]
  17. Giuseppe F. Italiano, Johannes A. La Poutré, Monika Rauch
    Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:212-223 [Conf]
  18. Rob van Stee, Johannes A. La Poutré
    Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:872-883 [Conf]
  19. Sander M. Bohte, Joost N. Kok, Johannes A. La Poutré
    SpikeProp: backpropagation for networks of spiking neurons. [Citation Graph (0, 0)][DBLP]
    ESANN, 2000, pp:419-424 [Conf]
  20. Sander M. Bohte, Joost N. Kok, Johannes A. La Poutré
    Modeling efficient conjunction detection with spiking neural networks. [Citation Graph (0, 0)][DBLP]
    ESANN, 2002, pp:263-268 [Conf]
  21. Pieter Jan't Hoen, Sander M. Bohte, Johannes A. La Poutré
    Action-Reaction in Multi-Agent Games. [Citation Graph (0, 0)][DBLP]
    EUMAS, 2005, pp:18-24 [Conf]
  22. Johannes A. La Poutré
    Maintenance of Triconnected Components of Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:354-365 [Conf]
  23. Nicolae B. Szirbik, G. R. Wagner, Johannes A. La Poutré
    A Generic Framework for Simulation of Supply Networks with Bargaining Agents. [Citation Graph (0, 0)][DBLP]
    APMS, 2002, pp:323-339 [Conf]
  24. Sander M. Bohte, Johannes A. La Poutré, Joost N. Kok
    Unsupervised Classification of Complex Clusters in Networks of Spiking Neurons. [Citation Graph (0, 0)][DBLP]
    IJCNN (3), 2000, pp:279-284 [Conf]
  25. Floortje Alkemade, Johannes A. La Poutré
    Boundedly Rational Agents Achieving Collusive Outcomes in the Cournot Game. [Citation Graph (0, 0)][DBLP]
    JCIS, 2002, pp:1143-1146 [Conf]
  26. Pieter Jan't Hoen, Karl Tuyls, Liviu Panait, Sean Luke, Johannes A. La Poutré
    An Overview of Cooperative and Competitive Multiagent Learning. [Citation Graph (0, 0)][DBLP]
    LAMAS, 2005, pp:1-46 [Conf]
  27. Jano I. van Hemert, Johannes A. La Poutré
    Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation. [Citation Graph (0, 0)][DBLP]
    PPSN, 2004, pp:692-701 [Conf]
  28. Floortje Alkemade, Johannes A. La Poutré, Hans Amman
    Intermediaries in an electronic trade network. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2003, pp:200-201 [Conf]
  29. Sander M. Bohte, Enrico Gerding, Johannes A. La Poutré
    Competitive market-based allocation of consumer attention space. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2001, pp:202-205 [Conf]
  30. Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer
    Improved Dynamic Dictionary Matching. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:392-401 [Conf]
  31. Johannes A. La Poutré
    New Techniques for the Union-Find Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:54-63 [Conf]
  32. Johannes A. La Poutré, Jeffery Westbrook
    Dynamic Two-Connectivity with Backtracking. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:204-212 [Conf]
  33. Johannes A. La Poutré
    Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:34-44 [Conf]
  34. Johannes A. La Poutré
    Alpha-algorithms for incremental planarity testing (preliminary version). [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:706-715 [Conf]
  35. D. J. A. Somefun, Johannes A. La Poutré
    Bundling and Pricing for Information Brokerage: Customer Satisfaction as a Means to Profit Optimization. [Citation Graph (0, 0)][DBLP]
    Web Intelligence, 2003, pp:182-189 [Conf]
  36. Rob van Stee, Johannes A. La Poutré
    Running a job on a collection of partly available machines, with on-line restarts. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2001, v:37, n:10, pp:727-742 [Journal]
  37. Luc De Raedt, Johannes A. La Poutré, Floor Verdenius
    AI Research in the Benelux - Guest Editorial. [Citation Graph (0, 0)][DBLP]
    AI Commun., 2000, v:13, n:1, pp:1-2 [Journal]
  38. Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer
    Improved Dynamic Dictionary Matching [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:119, n:2, pp:258-282 [Journal]
  39. D. J. A. Somefun, Enrico H. Gerding, Johannes A. La Poutré
    Efficient methods for automated multi-issue negotiation: Negotiating over a two-part tariff. [Citation Graph (0, 0)][DBLP]
    Int. J. Intell. Syst., 2006, v:21, n:1, pp:99-119 [Journal]
  40. Sander M. Bohte, Joost N. Kok, Johannes A. La Poutré
    Error-backpropagation in temporally encoded networks of spiking neurons. [Citation Graph (0, 0)][DBLP]
    Neurocomputing, 2002, v:48, n:1-4, pp:17-37 [Journal]
  41. Floortje Alkemade, D. D. B. van Bragt, Johannes A. La Poutré
    Stabilization of tag-mediated interaction by sexual reproduction in an evolutionary agent system. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2005, v:170, n:1, pp:101-119 [Journal]
  42. Rob van Stee, Johannes A. La Poutré
    Minimizing the total completion time on-line on a single machine, using restarts. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:57, n:2, pp:95-129 [Journal]
  43. Johannes A. La Poutré
    Lower Bounds for the Union-Find and the Sp;it-Find Problem on Pointer Machines. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:1, pp:87-99 [Journal]
  44. Johannes A. La Poutré
    Maintenance of 2- and 3-Edge-Connected Components of Graphs II. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1521-1549 [Journal]
  45. Johannes A. La Poutré, Jeffery Westbrook
    Dynamic 2-Connectivity with Backtracking. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:10-26 [Journal]
  46. Sander M. Bohte, Enrico Gerding, Johannes A. La Poutré
    Market-based recommendation: Agents that compete for consumer attention. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Internet Techn., 2004, v:4, n:4, pp:420-448 [Journal]
  47. Enrico Gerding, Johannes A. La Poutré
    Bilateral bargaining with multiple opportunities: knowing your opponent's bargaining position. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part C, 2006, v:36, n:1, pp:45-55 [Journal]
  48. I. B. Vermeulen, Sander M. Bohte, S. G. Elkhuizen, J. S. Lameris, P. J. M. Bakker, Johannes A. La Poutré
    Adaptive Optimization of Hospital Resource Calendars. [Citation Graph (0, 0)][DBLP]
    AIME, 2007, pp:305-315 [Conf]
  49. D. J. A. Somefun, Johannes A. La Poutré
    A Fast Method for Learning Non-linear Preferences Online Using Anonymous Negotiation Data. [Citation Graph (0, 0)][DBLP]
    TADA/AMEC, 2006, pp:118-131 [Conf]
  50. Johannes A. La Poutré
    A theorem on associative block designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:2, pp:205-208 [Journal]
  51. Johannes A. La Poutré, Jan van Leeuwen, Mark H. Overmars
    Maintenance of 2- and 3-edge- connected components of graphs I. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:329-359 [Journal]

  52. Optimization of Online Patient Scheduling with Urgencies and Preferences. [Citation Graph (, )][DBLP]


Search in 0.693secs, Finished in 0.695secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002