Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
53 | Daniel Lokshtanov, Jesper Nederlof |
Saving space by algebraization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 321-330, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
moebius, dynamic programming, space efficient, fourier |
45 | Siming Huang |
Inverse Problems of Some NP-Complete Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings, pp. 422-426, 2005, Springer, 3-540-26224-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
pseudo-polynomial algorithm, integer programming, Inverse problem, Knapsack problem |
43 | Jeng-Liang Tsai, Tsung-Hao Chen, Charlie Chung-Ping Chen |
Optimal minimum-delay/area zero-skew clock tree wire-sizing in pseudo-polynomial time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 2003 International Symposium on Physical Design, ISPD 2003, Monterey, CA, USA, April 6-9, 2003, pp. 166-173, 2003, ACM, 1-58113-650-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
?-optimal, incremental refinement, pseudo-polynomial, clock tree, wire-sizing, zero-skew |
28 | Florian Berger, Rolf Klein |
A traveller's problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010, pp. 176-182, 2010, ACM, 978-1-4503-0016-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
affine mappings, continuous dijkstra, frogger, pseudo-polynomial approximation, computational geometry, partition, np-hardness, motion planning, undecidability |
28 | Mark Cieliebak, Stephan J. Eidenbenz, Aris Pagourtzis |
Composing Equipotent Teams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings, pp. 98-108, 2003, Springer, 3-540-40543-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Rodolfo Pellizzoni, Giuseppe Lipari |
A New Sufficient Feasibility Test for Asynchronous Real-Time Periodic Task Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECRTS ![In: 16th Euromicro Conference on Real-Time Systems (ECRTS 2004), 30 June - 2 July 1004, Catania, Italy, Proceedings, pp. 204-211, 2004, IEEE Computer Society, 0-7695-2176-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Lisa Fleischer, Martin Skutella |
The Quickest Multicommodity Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 36-53, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
22 | Ferdinando Cicalese, Eduardo Sany Laber |
On the competitive ratio of evaluating priced functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 944-953, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Samarjit Chakraborty, Thomas Erlebach, Lothar Thiele |
On the Complexity of Scheduling Conditional Real-Time Code. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings, pp. 38-49, 2001, Springer, 3-540-42423-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia |
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 253, pp. 103-121, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Noriyuki Fujimoto |
A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Hong Kong, China, December 16-18, 2016, Proceedings, pp. 624-638, 2016, Springer, 978-3-319-48748-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
22 | Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner 0001 |
Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 196(1), pp. 247-261, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
22 | Yunlong Liu, Xiaodong Wu |
Fast Coupled Path Planning: From Pseudo-Polynomial to Polynomial. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, pp. 419-428, 2010, Springer, 978-3-642-14030-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
20 | Sudipta Sengupta |
Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings, pp. 79-90, 2003, Springer, 3-540-40545-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Hua Gong, Lixin Tang |
The Coordination of Two Parallel Machines Scheduling and Batch Deliveries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings, pp. 670-677, 2008, Springer, 978-3-540-69732-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
17 | Hans L. Bodlaender, Richard B. Tan, Thomas C. van Dijk, Jan van Leeuwen |
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings, pp. 102-113, 2008, Springer, 978-3-540-69900-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
17 | Xiliang Zhong, Cheng-Zhong Xu 0001 |
System-wide energy minimization for real-time tasks: lower bound and approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 2006 International Conference on Computer-Aided Design, ICCAD 2006, San Jose, CA, USA, November 5-9, 2006, pp. 516-521, 2006, ACM, 1-59593-389-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
17 | Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige |
Minimum Cost Source Location Problems with Flow Requirements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 769-780, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
17 | Rodolfo Pellizzoni, Giuseppe Lipari |
Feasibility Analysis of Real-Time Periodic Tasks with Offsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Real Time Syst. ![In: Real Time Syst. 30(1-2), pp. 105-128, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
scheduling, real-time systems |
17 | Yash P. Aneja, R. Chandrasekaran, K. P. K. Nair |
Minimal-cost system reliability with discrete-choice sets for components. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Reliab. ![In: IEEE Trans. Reliab. 53(1), pp. 71-76, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
17 | Terence Kelly |
Generalized Knapsack Solvers for Multi-unit Combinatorial Auctions: Analysis and Application to Computational Resource Allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AMEC ![In: Agent-Mediated Electronic Commerce VI, Theories for and Engineering of Distributed Mechanisms and Systems, AAMAS 2004 Workshop, AMEC 2004, New York, NY, USA, July 19, 2004, Revised Selected Papers, pp. 73-86, 2004, Springer, 3-540-29737-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
17 | Wing Ning |
Strongly NP-hard discrete gate-sizing problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(8), pp. 1045-1051, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
15 | Marcel Morales, Nguyen Thi Dung |
A "pseudo-polynomial" algorithm for the Frobenius number and Gröbner basis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Comput. ![In: J. Symb. Comput. 120, pp. 102233, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Mohammed Lalou, Hamamache Kheddouci |
Pseudo-polynomial algorithms for solving the Knapsack Problem with dependencies between items. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 158, pp. 106281, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan 0001, Saket Saurabh 0001 |
On the optimality of pseudo-polynomial algorithms for integer programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 198(1), pp. 561-593, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Ferenc Illés |
Linearly representable games and pseudo-polynomial calculation of the Shapley value. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.12324, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Pierre Bourhis, Laurence Duchien, Jérémie Dusart, Emmanuel Lonca, Pierre Marquis, Clément Quinton |
Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.05938, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
15 | Kanstantsin Pashkovich |
Computing the nucleolus of weighted voting games in pseudo-polynomial time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 195(1), pp. 1123-1133, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Masato Tanaka, Tomomi Matsui |
Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Soc. Sci. ![In: Math. Soc. Sci. 115, pp. 47-51, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Masato Tanaka, Tomomi Matsui |
Pseudo Polynomial Size LP Formulation for Calculating the Least Core Value of Weighted Voting Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2101.11180, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
15 | |
Retracted: A novel pseudo-polynomial approach for shortest paths problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 77(3), pp. 472, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Milos Danilovic, Dragan Vasiljevic, Biljana Cvetic |
A novel pseudo-polynomial approach for shortest path problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 78(2), pp. 107-127, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Maxence Delorme, Manuel Iori |
Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFORMS J. Comput. ![In: INFORMS J. Comput. 32(1), pp. 101-119, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Rei Mizuta |
Pseudo-Polynomial Time Algorithm for Computing Moments of Polynomials in Free Semicircular Elements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1901.08210, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Adam N. Letchford, Juan José Salazar González |
The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 272(1), pp. 24-31, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Dmitry I. Arkhipov, Olga Battaïa, Alexander A. Lazarev |
An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 275(1), pp. 35-44, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 267, pp. 74-95, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Soh Kumabe, Takanori Maehara, Ryoma Sin'ya |
Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings, pp. 248-260, 2019, Springer, 978-3-030-10563-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Klaus Jansen, Malin Rau |
Closing the Gap for Pseudo-Polynomial Strip Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 62:1-62:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Waldo Gálvez, Fabrizio Grandoni 0001, Salvatore Ingala, Arindam Khan 0001 |
Improved Pseudo-Polynomial-Time Approximation for Strip Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1801.07541, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Soh Kumabe, Takanori Maehara, Ryoma Sin'ya |
Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1807.04942, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Jatin Batra, Naveen Garg 0001, Amit Kumar 0001 |
Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-polynomial time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1802.07439, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Kanstantsin Pashkovich |
Computing the Nucleolus of Weighted Voting Games in Pseudo-polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1810.02670, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Jatin Batra, Naveen Garg 0001, Amit Kumar 0001 |
Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 778-789, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan 0001, Saket Saurabh 0001 |
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, pp. 31:1-31:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-081-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Yoshiyuki Karuno, Oki Nakahama |
Pseudo-Polynomial Time Algorithms for Producing Cardinality Constrained Packages by Multi-Head Weighers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCIS&ISIS ![In: 2018 Joint 10th International Conference on Soft Computing and Intelligent Systems (SCIS) and 19th International Symposium on Advanced Intelligent Systems (ISIS), Toyama, Japan, December 5-8, 2018, pp. 371-376, 2018, IEEE, 978-1-5386-2633-7. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Carlo Comin, Romeo Rizzi |
Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 77(4), pp. 995-1021, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Klaus Jansen, Malin Rau |
Closing the gap for pseudo-polynomial strip packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1712.04922, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | François Clautiaux, Saïd Hanafi, Rita Macedo, Marie-Emilie Voge, Cláudio Alves |
Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 258(2), pp. 467-477, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Nuno Braga, Cláudio Alves, Rita Macedo |
Exact Solution of the Multi-trip Inventory Routing Problem using a Pseudo-polynomial Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICORES ![In: Proceedings of the 6th International Conference on Operations Research and Enterprise Systems, ICORES 2017, Porto, Portugal, February 23-25, 2017., pp. 250-257, 2017, SciTePress, 978-989-758-218-9. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Jürgen Rietz, Cláudio Alves, Nuno Braga, José M. Valério de Carvalho |
An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 76, pp. 183-194, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Shuaian Wang |
Fundamental properties and pseudo-polynomial-time algorithm for network containership sailing speed optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 250(1), pp. 46-55, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Waldo Gálvez, Fabrizio Grandoni 0001, Salvatore Ingala, Arindam Khan 0001 |
Improved Pseudo-Polynomial-Time Approximation for Strip Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India, pp. 9:1-9:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-027-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Yuichi Sudo, Toshimitsu Masuzawa, Gen Motoyoshi, Tutomu Murase |
Pseudo Polynomial Time Algorithms for Optimal Longcut Route Selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Inf. Syst. ![In: IEICE Trans. Inf. Syst. 98-D(3), pp. 607-616, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Özgür Özpeynirci, Cansu Kandemir |
A Pseudo-Polynomial Time Algorithm for a Special Multiobjective Order Picking Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Inf. Technol. Decis. Mak. ![In: Int. J. Inf. Technol. Decis. Mak. 14(5), pp. 1111-1128, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Marcin Jurdzinski, Ranko Lazic 0001, Sylvain Schmitz |
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1502.06875, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
15 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and Few Random Positions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1508.03431, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
15 | Carlo Comin, Romeo Rizzi |
An Improved Pseudo-Polynomial Upper Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1503.04426, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
15 | Dvir Shabtay, George Steiner, Liron Yedidsion |
A pseudo-polynomial time algorithm for solving the resource dependent assignment problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 182, pp. 115-121, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Marcin Jurdzinski, Ranko Lazic 0001, Sylvain Schmitz |
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, pp. 260-272, 2015, Springer, 978-3-662-47665-9. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Oskar Skibski, Tomasz P. Michalak, Yuko Sakurai, Makoto Yokoo |
A Pseudo-Polynomial Algorithm for Computing Power Indices in Graph-Restricted Weighted Voting Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, pp. 631-637, 2015, AAAI Press, 978-1-57735-738-4. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
15 | Miguel Couceiro, Tamás Waldhauser |
Pseudo-polynomial functions over finite distributive lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fuzzy Sets Syst. ![In: Fuzzy Sets Syst. 239, pp. 21-34, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I, pp. 220-231, 2013, Springer, 978-3-642-39205-4. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | José Federico Vizcaino González, Christiano Lyra, Fábio Luiz Usberti |
A pseudo-polynomial algorithm for optimal capacitor placement on electric power distribution networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 222(1), pp. 149-156, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Marie-Emilie Voge, François Clautiaux |
Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCO ![In: Combinatorial Optimization - Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers, pp. 213-224, 2012, Springer, 978-3-642-32146-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Rita Macedo, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux, Saïd Hanafi |
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 214(3), pp. 536-545, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Ajay Kumar Bangla, David A. Castañón |
Pseudo-polynomial auction algorithm for Nonlinear Resource Allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACC ![In: American Control Conference, ACC 2011, San Francisco, CA, USA, June 29 - July 1, 2011, pp. 3880-3885, 2011, IEEE, 978-1-4577-0081-1. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Miguel Couceiro, Tamás Waldhauser |
Pseudo-polynomial Functions over Finite Distributive Lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECSQARU ![In: Symbolic and Quantitative Approaches to Reasoning with Uncertainty - 11th European Conference, ECSQARU 2011, Belfast, UK, June 29-July 1, 2011. Proceedings, pp. 545-556, 2011, Springer, 978-3-642-22151-4. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 7(3), pp. 136-148, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Sung-Pil Hong, Sung-Jin Cho, Myoung-Ju Park |
A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 193(2), pp. 351-364, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Giovanni Incerti |
Vibration control of a SCARA manipulator using pseudo-polynomial motion laws. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IROS ![In: 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems, September 22-26, 2008, Acropolis Convention Center, Nice, France, pp. 2802-2807, 2008, IEEE, 978-1-4244-2057-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Simone G. O. Fiori, Pietro Burrascano |
Analytical results on pseudo-polynomial functional-link neural units for blind density shaping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCNN ![In: International Joint Conference Neural Networks, IJCNN 1999, Washington, DC, USA, July 10-16, 1999, pp. 1117-1120, 1999, IEEE. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
15 | Takahito Kuno, Takahiro Utsunomiya |
A Pseudo-Polynomial Primal-Dual Algorithm for Globally Solving a Production-Transportation Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 11(2), pp. 163-180, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
15 | Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli |
Random Pseudo-Polynomial Algorithms for Exact Matroid Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 13(2), pp. 258-273, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
14 | Thi Huyen Chau Nguyen, Pascal Richard, Enrico Bini |
Approximation techniques for response-time analysis of static-priority tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Real Time Syst. ![In: Real Time Syst. 43(2), pp. 147-176, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Uniprocessor real-time scheduling, Static-priority tasks, Approximation scheme, Worst-case response time |
14 | Alejandro Masrur, Sebastian Drössler, Georg Färber |
Improvements in Polynomial-Time Feasibility Testing for EDF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: Design, Automation and Test in Europe, DATE 2008, Munich, Germany, March 10-14, 2008, pp. 1033-1038, 2008, ACM, 978-3-9810801-3-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
14 | Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks |
The Valve Location Problem in Simple Network Topologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers, pp. 55-65, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Valve location problem, computational complexity, dynamic programming, binary search, bounded treewidth |
14 | Lei Li, Jun Wei 0001, Tao Huang 0001 |
High Performance Approach for Multi-QoS Constrained Web Services Selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSOC ![In: Service-Oriented Computing - ICSOC 2007, Fifth International Conference, Vienna, Austria, September 17-20, 2007, Proceedings, pp. 283-294, 2007, Springer, 978-3-540-74973-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
14 | Sushu Zhang, Karam S. Chatha |
Approximation algorithm for the temperature-aware scheduling problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 2007 International Conference on Computer-Aided Design, ICCAD 2007, San Jose, CA, USA, November 5-8, 2007, pp. 281-288, 2007, IEEE Computer Society, 1-4244-1382-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
14 | Yuichi Asahiro, Jesper Jansson 0001, Eiji Miyano, Hirotaka Ono 0001, Kouhei Zenmyo |
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, Third International Conference, AAIM 2007, Portland, OR, USA, June 6-8, 2007, Proceedings, pp. 167-177, 2007, Springer, 978-3-540-72868-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
14 | Prabha Sharma |
Algorithms for the optimum communication spanning tree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 143(1), pp. 203-209, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Cost of communication, Cut-tree, Star-tree, Adjacent spanning tree, Adjacent basic feasible solution |
14 | Noureddine Kettaf, Abdelhafid Abouaissa, Thang Vu Duong, Pascal Lorenz |
An efficient QoS routing algorithm for solving MCP in ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Telecommun. Syst. ![In: Telecommun. Syst. 33(1-3), pp. 255-267, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Ad hoc, QoS routing, Path selection, Multiple constraints |
14 | Eranda Çela, Bettina Klinz, Christophe Meyer |
Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 12(3), pp. 187-215, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Quadratic 0-1 programming, Special case, Constant rank matrix, Stable sets, Local minima |
14 | Nathan Fisher, Sanjoy K. Baruah |
A Fully Polynomial-Time Approximation Scheme for Feasibility Analysis in Static-Priority Systems with Arbitrary Relative Deadlines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECRTS ![In: 17th Euromicro Conference on Real-Time Systems (ECRTS 2005), 6-8 July 2005, Palma de Mallorca, Spain, Proceedings, pp. 117-126, 2005, IEEE Computer Society, 0-7695-2400-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
14 | Ying Xiao 0001, Krishnaiyan Thulasiraman, Guoliang Xue |
Approximation and Heuristic Algorithms for Delay Constrained Path Selection under Inaccurate State Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QSHINE ![In: 1st International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE 2004), 18-20 October 2004, Dallas, TX, USA, pp. 130-137, 2004, IEEE Computer Society, 0-7695-2233-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
14 | Turgay Korkmaz, Marwan Krunz |
Routing multimedia traffic with QoS guarantees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Multim. ![In: IEEE Trans. Multim. 5(3), pp. 429-443, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
14 | Pascal Berthomé, Madiagne Diallo, Afonso Ferreira |
Generalized Parametric Multi-terminal Flows Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers, pp. 71-80, 2003, Springer, 3-540-20452-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
14 | Arye Barkan, Haim Kaplan |
Partial Alphabetic Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, pp. 114-125, 2002, Springer, 3-540-44180-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
14 | Samarjit Chakraborty, Simon Künzli 0001, Lothar Thiele |
Approximate Schedulability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTSS ![In: Proceedings of the 23rd IEEE Real-Time Systems Symposium (RTSS'02), Austin, Texas, USA, December 3-5, 2002, pp. 159-168, 2002, IEEE Computer Society, 0-7695-1851-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
14 | Xiaotie Deng, Chung Keung Poon, Yuzhong Zhang |
Approximation Algorithms in Batch Processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings, pp. 153-162, 1999, Springer, 3-540-66916-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
14 | Manfred Wiegers |
The k-section of Treewidth Restricted Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1990, MFCS'90, Banská Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings, pp. 530-537, 1990, Springer, 3-540-52953-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
11 | Franz-Josef Brandenburg, Mao-cheng Cai |
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings, pp. 4-15, 2009, Springer, 978-3-642-02269-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
extended networks, lossy and gainy arcs, max-flow, unit-loss networks, shortest path, NP-hard |
11 | Sushu Zhang, Karam S. Chatha, Goran Konjevod |
Near optimal battery-aware energy management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISLPED ![In: Proceedings of the 2009 International Symposium on Low Power Electronics and Design, 2009, San Fancisco, CA, USA, August 19-21, 2009, pp. 249-254, 2009, ACM, 978-1-60558-684-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
low power design, dynamic power management, dynamic voltage/frequency scaling |
11 | Xiliang Zhong, Cheng-Zhong Xu 0001 |
System-wide energy minimization for real-time tasks: Lower bound and approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Embed. Comput. Syst. ![In: ACM Trans. Embed. Comput. Syst. 7(3), pp. 28:1-28:24, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Real-Time systems, dynamic voltage scaling, dynamic power management, power-aware scheduling |
11 | Jiayu Gong, Xiliang Zhong, Cheng-Zhong Xu 0001 |
Energy and Timing Constrained System Reward Maximization on Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 28th IEEE International Conference on Distributed Computing Systems (ICDCS 2008), 17-20 June 2008, Beijing, China, pp. 809-816, 2008, IEEE Computer Society, 978-0-7695-3172-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
11 | Amitai Armon, Uri Zwick |
Multicriteria Global Minimum Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 46(1), pp. 15-26, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
11 | Chung-Yee Lee, Joseph Y.-T. Leung, Gang Yu |
Two Machine Scheduling under Disruptions with Transportation Considerations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 9(1), pp. 35-48, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
transportation, machine scheduling, disruption |
11 | Amitai Armon, Uri Zwick |
Multicriteria Global Minimum Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 65-76, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
11 | Feng Chu 0001, Chengbin Chu, Xiao Liu |
Lot sizing models with backlog or out-sourcing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SMC (5) ![In: Proceedings of the IEEE International Conference on Systems, Man & Cybernetics: The Hague, Netherlands, 10-13 October 2004, pp. 4342-4347, 2004, IEEE, 0-7803-8566-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
11 | Hadas Shachnai, Oded Shmueli, Robert Sayegh |
Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers, pp. 111-125, 2004, Springer, 3-540-24574-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|