Maximum Commonality Problems: Applications and Analysis

References

• Alon N., Shapira A., Sudakov B. Additive approximation for edge-deletion problems. Proc. 46th Annual IEEE Sympos. Foundations Comput. Sci. (FOCS) (2005) (IEEE Computer Society, Washington, D.C.) 419–428Crossref, Google Scholar
• Ambler S. W.Agile Modeling: Effective Practices for Extreme Programming and the Unified Process (2002) (John Wiley & Sons, New York) Google Scholar
• Astels D., Miller G., Novak M.A Practical Guide to Extreme Programming (2002) (Prentice Hall, Upper Saddle River, NJ) Google Scholar
• Beck K.Extreme Programming Explained: Embrace Change (2000) (Addison-Wesley, New York) Google Scholar
• Beck K., Fowler M.Planning Extreme Programming (2001) (Addison-Wesley, New York) Google Scholar
• Becker R. I., Schach S. R., Perl Y. A shifting algorithm for min-max tree partitioning. J. ACM (1982) 29(1):58–67Crossref, Google Scholar
• Berge C.Graphs and Hypergraphs (1973) (North-Holland, Amsterdam) Google Scholar
• Canfora G., Cimitile A., Visaggio C. A. An empirical study on the productivity of pair programming. Proc. 6th Internat. Conf. Extreme Programming and Agile Processes Software Engrg. (2005) (Springer, New York) 92–99Crossref, Google Scholar
• Constantine L. L.Constantine on Peopleware (1995) (Yourdon Press, Englewood Cliffs, NJ) Google Scholar
• Erdogmus H., Williams L. The economics of software development by pair programmers. Engrg. Economist (2003) 48(4):283–319Crossref, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman and Company, New York) Google Scholar
• Garfinkel R., Nemhauser G. L.Integer Programming (1972) (John Wiley & Sons, New York) Google Scholar
• Hadlock F. Minimum spanning forests of bounded trees. Proc. 5th Southeast Conf. Combinatorics, Graph Theory, and Comput. (1974) Boca Raton, FL:449–460Google Scholar
• Johar M., Kumar S., Dawande M., Mookerjee V. Optimizing the rotation of developers in extreme programming: A model and comparison. Proc. 13th Annual Workshop Inform. Tech. Systems (2003) Seattle, WA:97–102Google Scholar
• Karp R. M., Miller R. E., Thatcher J. W. Reducibility among combinatorial computations. Complexity of Computer Computations (1972) (Plenum Press, New York) 85–103Crossref, Google Scholar
• Kundu S., Misra J. A linear tree partitioning algorithm. SIAM J. Comput. (1977) 6(1):151–154Crossref, Google Scholar
• Kuppuswami S., Vivekandanam K., Ramaswamy P., Rodrigues P. The effects of individual XP practices on software development effort. ACM SIGSOFT Software Engrg. Notes (2003) 28(6):6–13Crossref, Google Scholar
• Micali S., Vazirani V. An O(√| V | ⋯ |E|) algorithm for finding maximum matching in general graphs. Proc. 21st Annual Sympos. Foundations Comput. Sci. (1980) Syracuse, NY:21–27Google Scholar
• Natanzon A., Shamir R., Sharan R. Complexity classification of some edge modification problems. Discrete Appl. Math. (2001) 113(1):109–128Crossref, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer Programming and Combinatorial Optimization (1988) (John Wiley & Sons, New York) Google Scholar
• Schrijver A.Combinatorial Optimization: Polyhedra and Efficiency (2003) C(Springer-Verlag, Berlin) Google Scholar
• Shukla A. Pair programming and the factors affecting Brooks' law. (2002) . Master's thesis, North Carolina State University, Raleigh, NCGoogle Scholar
• Srikanth H., Williams L., Wiebe E., Miller C., Balik S. On pair rotation in the computer science course. Proc. 17th Conf. Software Engrg. Ed. Training (2004) (IEEE Computer Society, Washington, D.C.) 144–149Crossref, Google Scholar
• Stewart D. B. Twenty-five most common mistakes with real-time software development. Proc. Embedded Systems Conf. (ESC) (2004) San Francisco, CA:1–13Google Scholar
• Williams L., Shukla A., Anton A. I. An initial exploration of the relationship between pair programming and Brooks' law. Proc. Agile Development Conf. (2004) (IEEE Computer Society, Washington, D.C.) 11–20Crossref, Google Scholar
• Williams L., Kessler R., Cunningham W., Jeffries R. Strengthening the case for pair-programming. IEEE Software (2000) 17(4):19–25Crossref, Google Scholar
• Wood A., Kleb W. Extreme programming in a research environment. Proc. 2nd XP Universe and 1st Agile Conf. Extreme Programming and Agile Methods (2002) (Springer-Verlag, London) 89–99Crossref, Google Scholar
• Yannakakis M. Node- and edge-deletion NP-complete problems. Proc. 10th Annual ACM Sympos. Theory Comput. (STOC) (1978) (ACM Press, New York) 253–264Crossref, Google Scholar
• Yannakakis M. Edge-deletion problems. SIAM J. Comput. (1981) 10:297–309Crossref, Google Scholar